Computing optimal contracts in combinatorial agencies
From MaRDI portal
Publication:714788
DOI10.1016/j.tcs.2012.05.018zbMath1259.91033MaRDI QIDQ714788
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.018
91A80: Applications of game theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial agency
- Algorithmic mechanism design (extended abstract)
- The Cost of Moral Hazard and Limited Liability in the Principal-Agent Problem
- Combinatorial Agency of Threshold Functions
- Efficient and Nearly-Efficient Partnerships
- Optimal Incentive Schemes with Many Agents
- Free-Riding and Free-Labor in Combinatorial Agency
- Algorithms, games, and the internet
- Algorithmic Game Theory