1 citations · 1 across the 2 of their papers we have counts for
14 papers
Online Multi-Agent Contracts
Paul Dütting, Michal Feldman, Yoav Gal-Tzur +1
We introduce and study an online variant of the multi-agent contract model. In our model, agents arrive one-by-one and are active with a certain probability. Upon arrival of agent…
Online Algorithms via Minimax and Posterior Matching
Thomas Kesselheim, Marco Molinaro, Kalen Patton +1
Competitive analysis is central to the study of online algorithms, but upper bounds are often highly problem-specific. We develop a more unifying methodology via the minimax viewpo…
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…
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…
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…