The secretary problem on an unknown poset

DOI10.1002/rsa.20466zbMath1278.90192arXiv1107.1379OpenAlexW2964062927MaRDI QIDQ2868083

Bryn Garrod, Robert Morris

Publication date: 23 December 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

optimal choicepartially ordered setssecretary problem

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Related Items (14)

Monotone Case for an Extended Process ⋮ The best choice problem for upward directed graphs ⋮ Query-based selection of optimal candidates 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 ⋮ Maximizing the expected number of components in an online search of a graph ⋮ The best-or-worst and the postdoc problems ⋮ Percolation and best-choice problem for powers of paths ⋮ The best choice problem for posets; colored complete binary trees ⋮ Secretary problem: graphs, matroids and greedoids ⋮ Counting embeddings of rooted trees into families of rooted trees ⋮ From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path ⋮ Where should you park your car? The $\frac{1}{2}$ rule ⋮ Weber's optimal stopping problem and generalizations

Cites Work

• Unnamed Item
• Partially ordered secretaries
• Multicriterial problem of optimum stopping of the selection process
• Who solved the secretary problem
• Partial-order analogue of the secretary problem: The binary tree case
• The best-choice problem for partially ordered objects.
• A decomposition theorem for partially ordered sets
• How to Choose the Best Twins
• On a universal best choice algorithm for partially ordered sets

This page was built for publication: The secretary problem on an unknown poset