11 citations · 48 across the 34 of their papers we have counts for
4 papers · 1 filter
Bandit Algorithms for Prophet Inequality and Pandora's Box
Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla +1
The Prophet Inequality and Pandora's Box problems are fundamental stochastic problem with applications in Mechanism Design, Online Algorithms, Stochastic Optimization, Optimal Stop…
Multi-Agent Contracts
Paul Duetting, Tomer Ezra, Michal Feldman +1
We study a natural combinatorial single-principal multi-agent contract design problem, in which a principal motivates a team of agents to exert effort toward a given task. At the h…
Simplified Prophet Inequalities for Combinatorial Auctions
Alexander Braun, Thomas Kesselheim
We consider prophet inequalities for XOS and MPH- combinatorial auctions and give a simplified proof for the existence of static and anonymous item prices which recover the stat…
Online and Bandit Algorithms Beyond Norms
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Vector norms play a fundamental role in computer science and optimization, so there is an ongoing effort to generalize existing algorithms to settings beyond and $\el…