Note: The best choice problem for a union of two linear orders with common maximum

Authors:
Wojciech Kamierczak
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 5
Cited 0

Partial-order analogue of the secretary problem: the binary tree case

Discrete Mathematics
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
The best-choice problem for partially ordered objects

Operations Research Letters
How to Choose the Best Twins

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We find optimal stopping times for the secretary problem considered on partially ordered sets that are unions of two independent finite linear orders that have a common best element. We also determine the optimal probability of success, i.e. choosing the best element, and the asymptotic value of this probability and a certain threshold behavior of the optimal stopping times when the number of elements in our set tends to infinity.