@article{ECP1579,
author = {Ragnar Freij and Johan Wästlund},
title = {Partially ordered secretaries},
journal = {Electron. Commun. Probab.},
fjournal = {Electronic Communications in Probability},
volume = {15},
year = {2010},
keywords = {secretary problem; best choice problem; partial order.},
abstract = {The elements of a finite nonempty partially ordered set are exposed at independent uniform times in $[0,1]$ to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector's task is to choose online a maximal element. This generalizes the classical linear order secretary problem, for which it is known that the selector can succeed with probability $1/e$ and that this is best possible. We describe a strategy for the general problem that achieves success probability at least $1/e$ for an arbitrary partial order.},
pages = {no. 45, 504-507},
issn = {1083-589X},
doi = {10.1214/ECP.v15-1579},
url = {http://ecp.ejpecp.org/article/view/1579}}