Back to search

Cornell University

SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY

Abstract

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.

Degree

thesis:*
Name thesis:degree_name
Ph. D., Operations Research
Level thesis:degree_level
Doctor of Philosophy
Discipline thesis:degree_discipline
Operations Research
Grantor
Cornell University
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ma, Sijia
Chair dc:contributor.chair
  • Henderson, Shane G.
Committee members dc:contributor.committeemember
  • Resnick, Sidney Ira
  • Chen, Yudong

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Bibid
10758095
Dc Identifier Other
ProQuest Submission ID: 11161
ProQuest Publication ID: 10975878

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ma, Sijia. SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY. Doctor of Philosophy thesis, Cornell University, 2018. https://hdl.handle.net/1813/64955