10 papers
Proportionally Fair Makespan Approximation
Michal Feldman, Jugal Garg, Vishnu V. Narayan +1
We study fair mechanisms for the classic job scheduling problem on unrelated machines with the objective of minimizing the makespan. This problem is equivalent to minimizing the eg…
Epistemic Pairwise Maximin Share
Michal Feldman, Amos Fiat, Yael Nissan +1
We introduce epistemic pairwise maximin share (EPMMS), a new fairness notion for fair division of indivisible goods. Two fundamental notions in this setting are envy-freeness up to…
Equal-Pay Contracts
Michal Feldman, Yoav Gal-Tzur, Tomasz Ponitka +1
We study multi-agent contract design, where a principal incentivizes a team of agents to take costly actions that jointly determine the project success via a combinatorial reward f…
Anonymous Contracts
Johannes Brustle, Paul Duetting, Stefano Leonardi +2
We study a multi-agent contracting problem where agents exert costly effort to achieve individually observable binary outcomes. While the principal can theoretically extract the fu…
One Action Too Many: Inapproximability of Budgeted Combinatorial Contracts
Michal Feldman, Yoav Gal-Tzur, Tomasz Ponitka +1
We study multi-agent contract design with combinatorial actions, under budget constraints, and for a broad class of objective functions, including profit (principal's utility), rew…
Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
Pooja Kulkarni, Ruta Mehta, Vishnu V. Narayan +1
We study the problem of fairly allocating indivisible items arriving online, among (offline) agents. Although envy-freeness has emerged as the archetypal fairness notion, e…