On a universal best choice algorithm for partially ordered sets

DOI10.1002/rsa.20192zbMath1138.06001OpenAlexW3083114581MaRDI QIDQ3503603

Nicholas Georgiou, Jarosław Niemiec, Michał Morayne, Małgorzata Kuchta

Publication date: 5 June 2008

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

Full work available at URL: https://doi.org/10.1002/rsa.20192

zbMATH Keywords

partial orderbest choicesecretary problem

Mathematics Subject Classification ID

Decision theory (91B06) Combinatorics of partially ordered sets (06A07) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (18)

Monotone Case for an Extended Process ⋮ An optimal algorithm for stopping on the element closest to the center of an interval ⋮ The best choice problem for upward directed graphs ⋮ Query-based selection of optimal candidates under the Mallows model ⋮ Optimal stopping for many connected components in a graph ⋮ A new look at the returning secretary problem ⋮ The best-or-worst and the postdoc problems with random number of candidates ⋮ Gusein-Zade problem for directed path ⋮ The best choice problem for a union of two linear orders with common maximum ⋮ An efficient algorithm for stopping on a sink in a directed 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 ⋮ Optimal stopping in a search for a vertex with full degree in a random graph ⋮ 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 ⋮ The secretary problem on an unknown poset

This page was built for publication: On a universal best choice algorithm for partially ordered sets