3 papers
cs.GT2025
Online Combinatorial Allocation with Interdependent Values
Michal Feldman, Simon Mauras, Divyarthi Mohan +1
We study online combinatorial allocation problems in the secretary setting, under interdependent values. In the interdependent model, introduced by Milgrom and Weber (1982), each a…
cs.GT2024
Pandora's Box Problem With Time Constraints
Georgios Amanatidis, Ben Berger, Tomer Ezra +4
The Pandora's Box problem models the search for the best alternative when evaluation is costly. In the simplest variant, a decision maker is presented with boxes, each associat…
cs.DS2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Georgios Amanatidis, Federico Fusco, Philip Lazos +3
Submodular maximization is a classic algorithmic problem with multiple applications in data mining and machine learning; there, the growing need to deal with massive instances moti…