Strong algorithms for the ordinal matroid secretary problem
Year of publication: |
2021
|
---|---|
Authors: | Soto, José A. ; Turkieltaub, Abner ; Verdugo, Victor |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 46.2021, 2, p. 642-673
|
Subject: | secretary problem | matroids | online algorithms | Suchtheorie | Search theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A simple O(log log(rank))-competitive algorithm for the matroid secretary problem
Feldman, Moran, (2018)
-
Iqbal, Javeria, (2015)
-
Optimal replenishment under price uncertainty
Mohr, Esther, (2017)
- More ...
-
The 5G spectrum auction in Chile
Escobar, Juan F., (2023)
-
Matuschke, Jannik, (2018)
-
Sample-driven optimal stopping : from the secretary problem to the i.i.d. prophet inequality
Correa, José, (2024)
- More ...