Pages that link to "Item:Q3503603"

The following pages link to On a universal best choice algorithm for partially ordered sets (Q3503603):

Displaying 18 items.

• Optimal stopping in a search for a vertex with full degree in a random graph (Q765377) (← links)
• The best-or-worst and the postdoc problems (Q1743480) (← links)
• The best choice problem for upward directed graphs (Q1926501) (← links)
• Gusein-Zade problem for directed path (Q1952502) (← links)
• Weber's optimal stopping problem and generalizations (Q2343650) (← links)
• A new look at the returning secretary problem (Q2424722) (← links)
• The best-or-worst and the postdoc problems with random number of candidates (Q2424796) (← links)
• The best choice problem for a union of two linear orders with common maximum (Q2446902) (← links)
• An efficient algorithm for stopping on a sink in a directed graph (Q2450610) (← links)
• An optimal algorithm for stopping on the element closest to the center of an interval (Q2665754) (← links)
• The secretary problem on an unknown poset (Q2868083) (← links)
• Monotone Case for an Extended Process (Q2939268) (← links)
• Percolation and best-choice problem for powers of paths (Q4684858) (← links)
• From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path (Q5251623) (← links)
• Where should you park your car? The $\frac{1}{2}$ rule (Q5854149) (← links)
• The best choice problem for posets; colored complete binary trees (Q5963606) (← links)
• Query-based selection of optimal candidates under the Mallows model (Q6057847) (← links)
• Optimal stopping for many connected components in a graph (Q6074658) (← links)