5 papers · 1 filter
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…
Ultra Efficient Contracts: Pushing the Boundaries of Tractable Contract Design
Michal Feldman, Liat Yashin
We study the optimal contract problem in the \emph{combinatorial actions} framework of Dütting et al.~[FOCS'21], where a principal delegates a project to an agent who chooses a sub…
Budget-Feasible Contracts
Michal Feldman, Yoav Gal-Tzur, Tomasz Ponitka +1
The problem of computing near-optimal contracts in combinatorial settings has recently attracted significant interest in the computer science community. Previous work has provided…
Succinct Ambiguous Contracts
Paul Duetting, Michal Feldman, Yarden Rashti
Real-world contracts are often ambiguous. While recent work by Dütting, Feldman, Peretz, and Samuelson (EC 2023, Econometrica 2024) demonstrates that ambiguous contracts can yield…
The Pseudo-Dimension of Contracts
Paul Duetting, Michal Feldman, Tomasz Ponitka +1
Algorithmic contract design studies scenarios where a principal incentivizes an agent to exert effort on her behalf. In this work, we focus on settings where the agent's type is dr…