Secretary problems with inspection costs as a game

DOI10.1007/BF01893368zbMath0499.62015MaRDI QIDQ1171846

S. Singh

Publication date: 1982

Published in: Metrika (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/175842

zbMATH Keywords

minimax strategiesinspection costsrandomized stopping rulessecretary problems

Mathematics Subject Classification ID

Minimax procedures in statistical decision theory (62C20) Optimal stopping in statistics (62L15) Decision theory for games (91A35)

Related Items

Optimal algorithms for the online time series search problem ⋮ Minimax stopping times for I.I.D. Random variables ⋮ Online algorithms for the multiple time series search problem ⋮ Minimax strategies for discounted ?secretary problems? with interview costs

Cites Work

• Optimal selection based on relative rank (the 'Secretary Problem')
• Dynamic Programming and Decision Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item