1 citations · 1 across the 5 of their papers we have counts for
6 papers
The Strong Secretary Conjecture is True for Linear Matroids
Kristóf Bérczi, Shaddin Dughmi, Vasilis Livanos +2
We prove a guarantee for the matroid secretary problem on linear matroids, therefore settling the strong secretary conjecture in this class of matroids. The result holds both…
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…
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…
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…
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…
Online Combinatorial Assignment in Independence Systems
Javier Marinkovic, José A. Soto, Victor Verdugo
We consider an online multi-weighted generalization of several classic online optimization problems, called the online combinatorial assignment problem. We are given an independenc…