Winning rate in the full-information best choice problem

2005/10/26 by Alexander Gnedin, Gnedin, Alexander, D.I. Miretskiy +2
Decision Sciences · Economics, Econometrics and Finance · Mathematics · #60G40 #Economic theories and models #FOS: Mathematics #Game Theory and Applications #Game Theory and Voting Systems #Probability (math.PR) #math.PR #msc:60G40

paper · pdf · doi:10.48550/arxiv.math/0510568

6 pages

openalex publication_date 2005/10/26 · arxiv created 2005/11/19 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Following a long-standing suggestion by Gilbert and Mosteller, we derive an explicit formula for the asymptotic winning rate in the full-information problem of the best choice.

Related

• A sharp bound for winning within a proportion of the maximum of a\n sequence
• Running minimum in the best-choice problem
• On the 1/e-strategy for the best-choice problem under no information
• Weighted games of best choice
• An exact solution for choosing the largest measurement from a sample\n drawn from an uniform distribution