The following pages link to Partially ordered secretaries (Q638228):
Displayed 20 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)
- Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← links)
- Secretary problem with hidden information; searching for a high merit candidate (Q2111202) (← links)
- Maximizing the expected number of components in an online search of a graph (Q2237242) (← 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)
- A Secretary Problem with Many Lives (Q2815355) (← 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)