On the game of googol

DOI10.1007/BF01245458zbMath0763.90106OpenAlexW1991400196MaRDI QIDQ1196120

Ulrich Krengel, Theodore P. Hill

Publication date: 7 December 1992

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01245458

zbMATH Keywords

secretary problemgame of googol

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Stochastic games, stochastic differential games (91A15)

Cites Work

• Minimax-optimal stop rules and distributions in secretary problems
• Who solved the secretary problem? With comments and a rejoinder by the author
• A note on random times
• Optimal selection based on relative ranks of a sequence by ties
• Minimax Stopping Rules when the Underlying Distribution is Uniform
• Optimal Selection from a Random Sequence with Learning of the Underlying Distribution

This page was built for publication: On the game of googol