Matroid Secretary Problems

Journal of the ACM, pp. 1-26, 2018.

Cited by: 5|Bibtex|Views71|DOI:https://doi.org/10.1145/3212512
EI
Other Links: dblp.uni-trier.de|dl.acm.org

Abstract:

We define a generalization of the classical secretary problem called the matroid secretary problem. In this problem, the elements of a matroid are presented to an online algorithm in uniformly random order. When an element arrives, the algorithm observes its value and must make an irrevocable decision whether or not to accept it. The acce...More

Code:

Data:

Your rating :
0

 

Tags
Comments