11 citations · 15 across the 8 of their papers we have counts for
13 papers
Online Combinatorial Allocations and Auctions with Few Samples
Paul Dütting, Thomas Kesselheim, Brendan Lucier +2
In online combinatorial allocations/auctions, n bidders sequentially arrive, each with a combinatorial valuation (such as submodular/XOS) over subsets of m indivisible items. The a…
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…
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions
Alexander Braun, Matthias Buttkus, Thomas Kesselheim
We consider the problem of posting prices for unit-demand buyers if all buyers have identically distributed valuations drawn from a distribution with monotone hazard rate. We s…
Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities
Alexander Braun, Thomas Kesselheim
We design novel mechanisms for welfare-maximization in two-sided markets. That is, there are buyers willing to purchase items and sellers holding items initially, both acting ratio…
Online Learning with Vector Costs and Bandits with Knapsacks
Thomas Kesselheim, Sahil Singla
We introduce online learning with vector costs (\OLVCp) where in each time step , we need to play an action that incurs an unknown vec…