{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/64955"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/64955","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY","abstract":"Ranking and selection (R&S) procedures are widely used for selecting the best among a set of candidate systems, where each candidate system is associated with a simulation model. In this thesis, we focus on three aspects on the sample com- plexity of the R&S problem. First, we develop a method for predicting the sample complexity. Second, we present Envelope Procedure (EP), a R&S procedure that delivers a probably approximately correct selection guarantee, and we provide a high probability upper bound on its sample complexity. We also prove a lower bound on the sample complexity for general R&S procedures. The performance of the EP is demonstrated by numerical experiments. Finally, we discuss some specific aspects and features of the EP in parallel computing environment and the sampling rules.","abstract_html":"Ranking and selection (R&amp;S) procedures are widely used for selecting the best among a set of candidate systems, where each candidate system is associated with a simulation model. In this thesis, we focus on three aspects on the sample com- plexity of the R&amp;S problem. First, we develop a method for predicting the sample complexity. Second, we present Envelope Procedure (EP), a R&amp;S procedure that delivers a probably approximately correct selection guarantee, and we provide a high probability upper bound on its sample complexity. We also prove a lower bound on the sample complexity for general R&amp;S procedures. The performance of the EP is demonstrated by numerical experiments. Finally, we discuss some specific aspects and features of the EP in parallel computing environment and the sampling rules.","abstract_has_math":false,"creators":["Ma, Sijia"],"institution":"Cornell University","degree_name":"Ph. D., Operations Research","degree_level":"Doctor of Philosophy","degree_discipline":"Operations Research","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Henderson, Shane G."],"committee_members":["Resnick, Sidney Ira","Chen, Yudong"],"year":2018,"date_issued":"2018-12-30","date_published":"2018-12-30","updated_at":"2026-11-19T03:20:35Z","subjects":["Parallel Computing","Ranking and Selection","Sample Complexity","simulation optimization","Operations research"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/jky4-4161"],"render_values":[{"text":"https://doi.org/10.7298/jky4-4161","href":"https://doi.org/10.7298/jky4-4161","code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["10758095"],"render_values":[{"text":"10758095","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11161","ProQuest Publication ID: 10975878"],"render_values":[{"text":"ProQuest Submission ID: 11161","href":null,"code":true},{"text":"ProQuest Publication ID: 10975878","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/64955","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/64955","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F64955","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Henderson, Shane G."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Resnick, Sidney Ira","Chen, Yudong"]},{"key":"dc:creator","label":"Author","values":["Ma, Sijia"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-04-02T14:00:56Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-04-02T14:00:56Z"]},{"key":"dc:date.issued","label":"Date","values":["2018-12-30"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Operations Research"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D., Operations Research"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Parallel Computing","Ranking and Selection","Sample Complexity","simulation optimization","Operations research"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["10758095"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/jky4-4161"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11161","ProQuest Publication ID: 10975878"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/64955"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"90078ec1-5371-4a2a-8325-c100e411e614\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2018-12-30</PublicationDate> <DOI>https://doi.org/10.7298/jky4-4161</DOI> <Authors> <Author> <DisplayName>Ma, Sijia</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Parallel Computing</Keyword> <Keyword>Ranking and Selection</Keyword> <Keyword>Sample Complexity</Keyword> <Keyword>simulation optimization</Keyword> <Keyword>Operations research</Keyword> <Abstract>Ranking and selection (R&S) procedures are widely used for selecting the best among a set of candidate systems, where each candidate system is associated with a simulation model. In this thesis, we focus on three aspects on the sample com- plexity of the R&S problem. First, we develop a method for predicting the sample complexity. Second, we present Envelope Procedure (EP), a R&S procedure that delivers a probably approximately correct selection guarantee, and we provide a high probability upper bound on its sample complexity. We also prove a lower bound on the sample complexity for general R&S procedures. The performance of the EP is demonstrated by numerical experiments. Finally, we discuss some specific aspects and features of the EP in parallel computing environment and the sampling rules.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Ma, Sijia"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description.abstract","label":"Abstract","values":["Ranking and selection (R&S) procedures are widely used for selecting the best among a set of candidate systems, where each candidate system is associated with a simulation model. In this thesis, we focus on three aspects on the sample com- plexity of the R&S problem. First, we develop a method for predicting the sample complexity. Second, we present Envelope Procedure (EP), a R&S procedure that delivers a probably approximately correct selection guarantee, and we provide a high probability upper bound on its sample complexity. We also prove a lower bound on the sample complexity for general R&S procedures. The performance of the EP is demonstrated by numerical experiments. Finally, we discuss some specific aspects and features of the EP in parallel computing environment and the sampling rules."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dcterms:license","label":"Dcterms License","values":["https://hdl.handle.net/1813/59810"]},{"key":"dc:title","label":"Title","values":["SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"90078ec1-5371-4a2a-8325-c100e411e614\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2018-12-30</PublicationDate> <DOI>https://doi.org/10.7298/jky4-4161</DOI> <Authors> <Author> <DisplayName>Ma, Sijia</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Parallel Computing</Keyword> <Keyword>Ranking and Selection</Keyword> <Keyword>Sample Complexity</Keyword> <Keyword>simulation optimization</Keyword> <Keyword>Operations research</Keyword> <Abstract>Ranking and selection (R&S) procedures are widely used for selecting the best among a set of candidate systems, where each candidate system is associated with a simulation model. In this thesis, we focus on three aspects on the sample com- plexity of the R&S problem. First, we develop a method for predicting the sample complexity. Second, we present Envelope Procedure (EP), a R&S procedure that delivers a probably approximately correct selection guarantee, and we provide a high probability upper bound on its sample complexity. We also prove a lower bound on the sample complexity for general R&S procedures. The performance of the EP is demonstrated by numerical experiments. Finally, we discuss some specific aspects and features of the EP in parallel computing environment and the sampling rules.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Ma, Sijia"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Henderson, Shane G."],"dc:contributor.committeemember":["Resnick, Sidney Ira","Chen, Yudong"],"dc:creator":["Ma, Sijia"],"dc:date.accessioned":["2019-04-02T14:00:56Z"],"dc:date.available":["2019-04-02T14:00:56Z"],"dc:date.issued":["2018-12-30"],"dc:description.abstract":["Ranking and selection (R&S) procedures are widely used for selecting the best among a set of candidate systems, where each candidate system is associated with a simulation model. In this thesis, we focus on three aspects on the sample com- plexity of the R&S problem. First, we develop a method for predicting the sample complexity. Second, we present Envelope Procedure (EP), a R&S procedure that delivers a probably approximately correct selection guarantee, and we provide a high probability upper bound on its sample complexity. We also prove a lower bound on the sample complexity for general R&S procedures. The performance of the EP is demonstrated by numerical experiments. Finally, we discuss some specific aspects and features of the EP in parallel computing environment and the sampling rules."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["10758095"],"dc:identifier.doi":["https://doi.org/10.7298/jky4-4161"],"dc:identifier.other":["ProQuest Submission ID: 11161","ProQuest Publication ID: 10975878"],"dc:identifier.uri":["https://hdl.handle.net/1813/64955"],"dc:language.iso":["en_US"],"dc:subject":["Parallel Computing","Ranking and Selection","Sample Complexity","simulation optimization","Operations research"],"dcterms:license":["https://hdl.handle.net/1813/59810"],"dc:title":["SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Operations Research"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph. D., Operations Research"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:20:35Z"}