Minimax strategies for discounted ?secretary problems? with interview costs

DOI10.1007/BF01432811zbMath0822.90146OpenAlexW2078003658MaRDI QIDQ4698116

Norbert Schmitz

Publication date: 14 May 1995

Published in: [https://portal.mardi4nfdi.de/entity/Q4289815 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research] (Search for Journal in Brave)

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

zbMATH Keywords

optimal choicesaddle-pointdiscountingminimax strategiessecretary problemsinterview costsgame of stopping

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Minimax-optimal stop rules and distributions in secretary problems
• Secretary problems with inspection costs as a game
• Who solved the secretary problem? With comments and a rejoinder by the author
• Optimal selection based on relative rank (the 'Secretary Problem')
• The Secretary Problem and Its Extensions: A Review
• Optimal Selection from a Finite Sequence with Sampling Cost

This page was built for publication: Minimax strategies for discounted ?secretary problems? with interview costs