11 citations · 48 across the 34 of their papers we have counts for
5 papers · 1 filter
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…
Supermodular Approximation of Norms and Applications
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Many classical problems in theoretical computer science involve norm, even if implicitly; for example, both XOS functions and downward-closed sets are equivalent to some norms. The…
Approximating Optimum Online for Capacitated Resource Allocation
Alexander Braun, Thomas Kesselheim, Tristan Pollner +1
We study online capacitated resource allocation, a natural generalization of online stochastic max-weight bipartite matching. This problem is motivated by ride-sharing and Internet…
Sample Complexity of Posted Pricing for a Single Item
Billy Jin, Thomas Kesselheim, Will Ma +1
Selling a single item to self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximi…
Multi-Agent Combinatorial Contracts
Paul Duetting, Tomer Ezra, Michal Feldman +1
Combinatorial contracts are emerging as a key paradigm in algorithmic contract design, paralleling the role of combinatorial auctions in algorithmic mechanism design. In this paper…