Opportunity costs in the game of best choice

zbMath1409.60065arXiv1903.01821MaRDI QIDQ1733925

Michael Urbanski, Kaitlyn Myers, Laura Taalman, Madeline Crews, Breeann Wilson, Brant C. Jones

Publication date: 22 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.01821

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (3)

Finding the second-best candidate under the Mallows model ⋮ Query-based selection of optimal candidates under the Mallows model ⋮ Sequential selections with minimization of failure

Uses Software

• DLMF

Cites Work

• Unnamed Item
• The shape of random pattern-avoiding permutations
• Who solved the secretary problem
• Positional strategies in games of best choice
• Decision Making: A Golden Rule
• Secretary Problems with Non-Uniform Arrival Order
• Extremal processes, secretary problems and the 1/e law
• The Secretary Problem and Its Extensions: A Review
• A generalization of the classical secretary problem: dependent arrival sequences
• Lannes’ T functor on injective unstable modules and Harish-Chandra restriction
• The probability of avoiding consecutive patterns in the Mallows distribution

This page was built for publication: Opportunity costs in the game of best choice