Pages that link to "Item:Q2868083"
From MaRDI portal
The following pages link to The secretary problem on an unknown poset (Q2868083):
Displaying 18 items.
- Partially ordered secretaries (Q638228) (← links)
- The best-or-worst and the postdoc problems (Q1743480) (← links)
- The best choice problem for upward directed graphs (Q1926501) (← links)
- Secretary problem: graphs, matroids and greedoids (Q2068844) (← links)
- Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← links)
- Maximizing the expected number of components in an online search of a graph (Q2237242) (← 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)
- Monotone Case for an Extended Process (Q2939268) (← links)
- On a universal best choice algorithm for partially ordered sets (Q3503603) (← links)
- (Q3773685) (← 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)