The best choice problem for a union of two linear orders with common maximum

DOI10.1016/j.dam.2013.06.026zbMath1309.60041WikidataQ115926604 ScholiaQ115926604MaRDI QIDQ2446902

Wojciech Kaźmierczak

Publication date: 23 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.026

zbMATH Keywords

optimal stopping; secretary problem

Mathematics Subject Classification ID

60G40: Stopping times; optimal stopping problems; gambling theory

Related Items

Percolation and best-choice problem for powers of paths, From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path, The best choice problem for posets; colored complete binary trees, Counting embeddings of rooted trees into families of rooted trees, Monotone Case for an Extended Process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partially ordered secretaries
• Who solved the secretary problem
• Partial-order analogue of the secretary problem: The binary tree case
• The best-choice problem for partially ordered objects.
• Optimal selection based on relative rank (the 'Secretary Problem')
• A Secretary Problem with Many Lives
• How to Choose the Best Twins
• On a universal best choice algorithm for partially ordered sets
• A secretary problem with uncertain employment
• Recognizing the maximum of a random sequence based on relative rank with backward solicitation
• An Upper Bound for Spherical Caps
• Dynamic Programming and Decision Theory