11 citations · 48 across the 34 of their papers we have counts for
5 papers · 1 filter
Black-Box Lifting and Robustness Theorems for Multi-Agent Contracts
Paul Dütting, Tomer Ezra, Michal Feldman +1
Multi-agent contract design has largely evaluated contracts through the lens of pure Nash equilibria (PNE). This focus, however, is not without loss: In general, the principal can…
Prophet and Secretary at the Same Time
Gregory Kehne, Thomas Kesselheim
Many online problems are studied in stochastic settings for which inputs are samples from a known distribution, given in advance, or from an unknown distribution. Such distribution…
An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
Daniel Blankenburg, Antonia Ellerbrock, Thomas Kesselheim +1
We study the problem of minimizing an ordered norm of a load vector (indexed by a set of resources), where a finite number of customers contribute to the load of each r…
Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
Thomas Kesselheim, Marco Molinaro, Kalen Patton +1
Online Set Cover and Load Balancing are central problems in online optimization, and there is a long line of work on developing algorithms for these problems with convex objectives…
Contextual Learning for Stochastic Optimization
Anna Heuser, Thomas Kesselheim
Motivated by stochastic optimization, we introduce the problem of learning from samples of contextual value distributions. A contextual value distribution can be understood as a fa…