Tractable sampling strategies for ordinal optimization

Dongwook Shin, Mark Broadie, Assaf Zeevi

Research output: Contribution to journalArticlepeer-review

Abstract

We consider a problem of ordinal optimization where the objective is to select the best of several competing alternatives (“systems”) when the probability distributions governing each system’s performance are not known but can be learned via sampling. The objective is to dynamically allocate samples within a finite sampling budget to minimize the probability of selecting a system that is not the best. This objective does not possess an analytically tractable solution. We introduce a family of practically implementable sampling policies and show that the performance exhibits (asymptotically) near-optimal performance. Furthermore, we show via numerical testing that the proposed policies perform well compared with other benchmark policies.

Original languageEnglish
Pages (from-to)1693-1712
Number of pages20
JournalOperations Research
Volume66
Issue number6
DOIs
StatePublished - Nov 2018
Externally publishedYes

Keywords

  • Dynamic sampling
  • Optimal learning
  • Ranking and selection

Fingerprint

Dive into the research topics of 'Tractable sampling strategies for ordinal optimization'. Together they form a unique fingerprint.

Cite this