1 citations · 1 across the 3 of their papers we have counts for
3 papers
Knapsack Secretary is not -Competitive
Marius Garbea, Rishi Patel, Emmanouil Pountourakis
We prove that no algorithm for the knapsack secretary problem can be -competitive. The knapsack secretary problem was first introduced by Babaioff, Immorlica, Kempe, and Klein…
Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
Robin Bowers, Marius Garbea, Emmanouil Pountourakis +1
This paper derives polynomial-time approximation schemes for several NP-hard stochastic optimization problems from the algorithmic mechanism design and operations research literatu…
EFx Budget-Feasible Allocations with High Nash Welfare
Marius Garbea, Vasilis Gkatzelis, Xizhi Tan
We study the problem of allocating indivisible items to budget-constrained agents, aiming to provide fairness and efficiency guarantees. Specifically, our goal is to ensure that th…