Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
The Multiple-Choice Matroid Secretary Problem
Matías Ortiz-Angel, José A. Soto
We introduce and study the multiple-choice matroid secretary problem, denoted -MSP. For rank-one matroids and , it reduces to the classical secretary problem with…
cs.DS2025
Free-Order Online Selection for k-Systems
Kristóf Bérczi, Vasilis Livanos, José A. Soto +1
The Matroid Secretary Problem is a central question in online optimization, modeling sequential decision-making under combinatorial constraints. We introduce a bipartite graph fram…
cs.DS2024
Matroid Secretary via Labeling Schemes
Kristóf Bérczi, Vasilis Livanos, José Soto +1
The Matroid Secretary Problem (MSP) is one of the most prominent settings for online resource allocation and optimal stopping. A decision-maker is presented with a ground set of el…