Full-information best choice game with hint

DOI10.1007/s00186-019-00666-wzbMath1433.91040OpenAlexW2941368384WikidataQ128010858 ScholiaQ128010858MaRDI QIDQ2009175

Marek Skarupski

Publication date: 27 November 2019

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-019-00666-w

zbMATH Keywords

optimal stoppingMarkov chainmatrix gamethreshold strategybest choice problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40) Decision theory for games (91A35) Games of timing (91A55)

Related Items (3)

Average number of candidates surveyed by the headhunter in the recruitment ⋮ Sequential selections with minimization of failure ⋮ Robust best choice problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The full-information best choice problem with a random number of observations
• On optimal stopping of a sequence of independent random variables- probability maximizing approach
• Who solved the secretary problem
• Iterated full information secretary problem
• Hint, extortion, and guessing games in the best choice problem
• A full-information best-choice problem with finite memory
• Full-information best-choice problems with recall of observations and uncertainty of selection depending on the observation
• On the full information best-choice problem
• Winning Rate in the Full-Information Best-Choice Problem

This page was built for publication: Full-information best choice game with hint