The best choice problem with random arrivals: how to beat the 1 / e-strategy

DOI10.1016/J.SPA.2021.12.008zbMATH Open1480.60104OpenAlexW4200292535MaRDI QIDQ2074989FDOQ2074989

Authors: Alexander Gnedin 

Publication date: 11 February 2022

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spa.2021.12.008

Recommendations

• The 1/e-strategy is sub-optimal for the problem of best choice under no information
• A unified approach to a class of best choice problems with an unknown number of options
• A random arrival time best-choice problem with uniform prior on the number of arrivals
• scientific article; zbMATH DE number 1117672
• Strategies in the secretary problem

zbMATH Keywords

optimal stoppingdominanceminimax strategybest choice problemrandom arrivals\( 1 / e\)-strategy

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Probabilistic games; gambling (91A60)

Cites Work

• Title not available (Why is that?)
• On the characterization of point processes with the order statistic property without the moment condition
• Title not available (Why is that?)
• Who solved the secretary problem
• The Best Choice Problem for a Random Number of Objects
• Title not available (Why is that?)
• Title not available (Why is that?)
• Embedding optimal selection problems in a Poisson process
• Stochastic processes with proportional increments and the last-arrival problem
• A unified approach to a class of best choice problems with an unknown number of options
• A stochastic game of optimal stopping and order selection
• On an optimal selection problem of Cowan and Zabczyk
• An Optimal Selection Problem Associated with the Poisson Process
• Minimax-optimal stop rules and distributions in secretary problems
• Random measures, theory and applications
• Invariant record processes and applications to best choice modelling
• Random record models
• The Secretary Problem with an Unknown Number of Options
• Conditions for quasi-stationarity of the Bayes rule in selection problems with an unknown number of rankable options
• A unified approach to a class of optimal selection problems with an unknown number of options
• The infinite secretary problem
• Optimal selection based on relative ranks with a random number of individuals
• A random arrival time best-choice problem with uniform prior on the number of arrivals
• A solution to the game of googol
• Random record processes and state dependent thinning
• The secretary problem with an unknown number of candidates
• Minimax-Optimal Strategies for the Best-Choice Problem When a Bound is Known for the Expected Number of Objects
• Secretary problems as a source of benchmark bounds
• A note on the full-information Poisson arrival selection problem
• Choosing the best of the current crop
• Title not available (Why is that?)
• Guess the larger number

Cited In (5)

• Choosing rarity: an exercise in stopping times
• The 1/e-strategy is sub-optimal for the problem of best choice under no information
• Dynamic threshold strategy for universal best choice problem
• Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
• A random arrival time best-choice problem with uniform prior on the number of arrivals

This page was built for publication: The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074989)