Minimax strategies for discounted ?secretary problems? with interview costs

DOI10.1007/BF01432811zbMATH Open0822.90146OpenAlexW2078003658MaRDI QIDQ4698116FDOQ4698116

Authors: N. Schmitz 

Publication date: 14 May 1995

Published in: 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

Recommendations

• scientific article; zbMATH DE number 513207
• Interview Costs in the Secretary Problem
• The secretary problem: optimal selection with interview cost from two groups of candidates
• scientific article; zbMATH DE number 67285

zbMATH Keywords

discountingsaddle-pointminimax strategiesoptimal choicesecretary problemsinterview costsgame of stopping

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• The secretary problem: optimal selection with interview cost from two groups of candidates

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

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