Competitive secretary problem

DOI10.1007/S00182-025-00931-9MaRDI QIDQ6992125zbMATH OpenFDO

Authors Tom McGrath, Marc Schröder

Publication date 28 April 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00182-025-00931-9

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Multistage and repeated games (91A20) Games of timing (91A55)

Cites work

• A sharp lower bound for choosing the maximum of an independent sequence
• Competition and recall in selection problems
• Competitive Analysis with a Sample and the Secretary Problem
• Dueling algorithms
• Dynamic Programming and Decision Theory
• scientific article; zbMATH DE number 3383344 (Why is no real title available?)
• Progressive stopping heuristics that excel in individual and competitive sequential search
• Secretary Problems via Linear Programming
• The postdoc variant of the secretary problem
• The Secretary Problem and Its Extensions: A Review
• Who solved the secretary problem

This page was built for publication: Competitive secretary problem

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