Models of random partial orders
Surveys in combinatorics, 1993
Partial-order analogue of the secretary problem: the binary tree case
Discrete Mathematics
A Ratio Inequality for Binary Trees and the Best Secretary
Combinatorics, Probability and Computing
On a universal best choice algorithm for partially ordered sets
Random Structures & Algorithms
Hiring a secretary from a poset
Proceedings of the 12th ACM conference on Electronic commerce
Note: Optimal stopping in a search for a vertex with full degree in a random graph
Discrete Applied Mathematics
Gusein-Zade problem for directed path
Discrete Optimization
SIAM Journal on Discrete Mathematics
Note: The best choice problem for a union of two linear orders with common maximum
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider the problem of making a single on-line selection from a random sequence of partially ordered objects. We show that, as long as the number of objects is given in advance, the selector can pick a maximal one with probability at least 18, without prior knowledge of the partial order.