The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy
type: Item
instance of: scholarly article
title: The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy
zbMATH Open document ID: 1480.60104
published in: Stochastic Processes and their Applications
publication date: 2022-02-11T00:00:00Z
Mathematics Subject Classification ID: 60G40
Mathematics Subject Classification ID: 91A60
zbMATH DE Number: 7472523
zbMATH Keywords: best choice problem
zbMATH Keywords: optimal stopping
zbMATH Keywords: random arrivals
zbMATH Keywords: \( 1 / e\)-strategy
zbMATH Keywords: minimax strategy
zbMATH Keywords: dominance
author: Alexander Gnedin
MaRDI profile type: Publication
full work available at URL: j.spa.2021.12.008
OpenAlex ID: W4200292535
cites work: The secretary problem with an unknown number of candidates
cites work: Q3702324
cites work: Q5829371
cites work: Random record processes and state dependent thinning
cites work: A unified approach to a class of best choice problems with an unknown number of options
cites work: On an optimal selection problem of Cowan and Zabczyk
cites work: Invariant record processes and applications to best choice modelling
cites work: Embedding optimal selection problems in a Poisson process
cites work: A unified approach to a class of optimal selection problems with an unknown number of options
cites work: Conditions for quasi-stationarity of the Bayes rule in selection problems with an unknown number of rankable options
cites work: Stochastic processes with proportional increments and the last-arrival problem
cites work: Choosing the best of the current crop
cites work: Q4002436
cites work: An Optimal Selection Problem Associated with the Poisson Process
cites work: Who solved the secretary problem
cites work: Random record models
cites work: The infinite secretary problem
cites work: Optimal selection based on relative ranks with a random number of individuals
cites work: A solution to the game of googol
cites work: Guess the Larger Number
cites work: A stochastic game of optimal stopping and order selection
cites work: Minimax-Optimal Strategies for the Best-Choice Problem When a Bound is Known for the Expected Number of Objects
cites work: Minimax-optimal stop rules and distributions in secretary problems
cites work: Random Measures, Theory and Applications
cites work: A note on the full-information Poisson arrival selection problem
cites work: Q4707348
cites work: The Best Choice Problem for a Random Number of Objects
cites work: On the characterization of point processes with the order statistic property without the moment condition
cites work: Q4001778
cites work: Secretary problems as a source of benchmark bounds
cites work: The Secretary Problem with an Unknown Number of Options
cites work: A Random Arrival Time Best-Choice Problem with Uniform Prior on the Number of Arrivals
DOI: 10.1016/J.SPA.2021.12.008
description: scientific article; zbMATH DE number 7472523