The best-or-worst and the postdoc problems

DOI10.1007/s10878-017-0203-4zbMath1416.90039arXiv1706.07185OpenAlexW2710481597MaRDI QIDQ1743480

L. Bayón, M. M. Ruiz, Antonio M. Oller-Marcén, José María Grau, Pedro Fortuny Ayuso

Publication date: 13 April 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationsecretary problembest-or-worst problempostdoc problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Related Items (7)

The multi-returning secretary problem ⋮ Finding the second-best candidate under the Mallows model ⋮ A new look at the returning secretary problem ⋮ The best-or-worst and the postdoc problems with random number of candidates ⋮ Odds -theorem and monotonicity ⋮ An extension of the last-success-problem ⋮ A new method for computing asymptotic results in optimal stopping problems

Cites Work

• Partially ordered secretaries
• Who solved the secretary problem
• A new secretary problem with rank-based selection and cardinal payoffs
• The secretary problem on an unknown poset
• Limit Theorems for a General Stochastic Rumour Model
• On a universal best choice algorithm for partially ordered sets
• A rank-based selection with cardinal payoffs and a cost of choice
• A Problem of Optimal Choice and Assignment
• The postdoc variant of the secretary problem
• Dynamic Programming and Decision Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The best-or-worst and the postdoc problems