On a universal best choice algorithm for partially ordered sets

DOI10.1002/RSA.20192MaRDI QIDQ3503603zbMATH OpenOpenAlexFDO

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

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

best choicepartial ordersecretary problem

Mathematics Subject Classification ID

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

Recommendations

• The best-choice problem for partially ordered objects.
• Dynamic threshold strategy for universal best choice problem
• The best choice problem for a union of two linear orders with common maximum
• The secretary problem on an unknown poset
• Partially ordered secretaries

Cited in

(25)

• Some optimal algorithms for decomposed partially ordered sets
• The best-or-worst and the postdoc problems
• The best choice problem for upward directed graphs
• Gusein-Zade problem for directed path
• The best-choice problem for partially ordered objects.
• Weber's optimal stopping problem and generalizations
• A new look at the returning secretary problem
• The best-or-worst and the postdoc problems with random number of candidates
• 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
• An optimal algorithm for stopping on the element closest to the center of an interval
• The secretary problem on an unknown poset
• Monotone Case for an Extended Process
• Dynamic threshold strategy for universal best choice problem
• Percolation and best-choice problem for powers of paths
• 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 best choice problem for posets; colored complete binary trees
• Query-based selection of optimal candidates under the Mallows model
• Optimal stopping for many connected components in a graph
• Partially ordered secretaries
• Prudent k-choice functions: Properties and algorithms
• Hiring strategies
• Optimal stopping in a search for a vertex with full degree in a random graph
• p-best response set

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503603)