The following pages link to How to Choose the Best Twins (Q2902908):
Displaying 10 items.
- The best choice problem for upward directed graphs (Q1926501) (← links)
- The multi-returning secretary problem (Q2166212) (← links)
- A new look at the returning secretary problem (Q2424722) (← links)
- The best choice problem for a union of two linear orders with common maximum (Q2446902) (← 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)
- The best choice problem for posets; colored complete binary trees (Q5963606) (← links)
- Two measures of efficiency for the secretary problem with multiple items at each rank (Q6614408) (← links)
