3 papers
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.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…
cs.GT2024
Prophet Upper Bounds for Online Matching and Auctions
José Soto, Victor Verdugo
In the online 2-bounded auction problem, we have a collection of items represented as nodes in a graph and bundles of size two represented by edges. Agents are presented sequential…