The Complexity of Contracts

27 Feb 2020 Duetting Paul Roughgarden Tim Talgam-Cohen Inbal

We initiate the study of computing (near-)optimal contracts in succinctly representable principal-agent settings. Here optimality means maximizing the principal's expected payoff over all incentive-compatible contracts---known in economics as "second-best" solutions... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • COMPUTER SCIENCE AND GAME THEORY

Datasets


  Add Datasets introduced or used in this paper