The best-choice problem for partially ordered objects.
From MaRDI portal
Publication:1969766
DOI10.1016/S0167-6377(99)00053-XzbMath1063.91506OpenAlexW2051231039WikidataQ127149244 ScholiaQ127149244MaRDI QIDQ1969766
Publication date: 1999
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00053-x
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 ⋮ 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 ⋮ Maximizing the expected number of components in an online search of a graph ⋮ 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 ⋮ Counting embeddings of a chain into a tree ⋮ 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 ⋮ The secretary problem on an unknown poset ⋮ Secretary problem with hidden information; searching for a high merit candidate
Cites Work
This page was built for publication: The best-choice problem for partially ordered objects.
