Laminar Matroid Secretary: Greedy Strikes Back
Data Structures and Algorithms
2024-07-03 v2 Computer Science and Game Theory
Abstract
We show that a simple greedy algorithm is probability-competitive for the Laminar Matroid Secretary Problem, improving the -competitive algorithm based on the forbidden sets technique (Soto, Turkieltaub, and Verdugo, 2018).
Cite
@article{arxiv.2308.09880,
title = {Laminar Matroid Secretary: Greedy Strikes Back},
author = {Zhiyi Huang and Zahra Parsaeian and Zixuan Zhu},
journal= {arXiv preprint arXiv:2308.09880},
year = {2024}
}