Computing optimal contracts in combinatorial agencies

DOI10.1016/J.TCS.2012.05.018MaRDI QIDQ714788zbMATH OpenOpenAlexFDO

Authors Yuval Emek, Michal Feldman

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

zbMATH Keywords

game theorymechanism designhidden action

Mathematics Subject Classification ID

Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The complexity of contracts
• Combinatorial agency
• Mixed strategies in combinatorial agency
• Learning approximately optimal contracts
• Targeting in networks under costly agreements

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2156280 (Why is no real title available?)
• Algorithmic Game Theory
• Algorithmic mechanism design (extended abstract)
• Algorithms, games, and the internet
• Combinatorial agency
• Combinatorial agency of threshold functions
• Efficient and Nearly-Efficient Partnerships
• Free-riding and free-labor in combinatorial agency
• Optimal Incentive Schemes with Many Agents
• The cost of moral hazard and limited liability in the principal-agent problem

Cited in

(12)

• Targeting in networks under costly agreements
• Optimal sequencing of contract algorithms
• The complexity of contracts
• Combinatorial agency
• Optimal contracts for outsourced computation
• A comparison of cardinal tournaments and piece rate contracts with liquidity constrained agents
• Free-riding and free-labor in combinatorial agency
• Mixed strategies in combinatorial agency
• Combinatorial agency of threshold functions
• Multi-agent contracts
• Learning approximately optimal contracts
• Computational principal-agent problems

This page was built for publication: Computing optimal contracts in combinatorial agencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714788)