Computing an Optimal Contract in Simple Technologies
AbstractWe study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent is hidden and affects the (binary) outcome of the agent's individual task stochastically. A Boolean function, called technology, maps the individual tasks' outcomes into the outcome of the whole project. The principal induces a Nash equilibrium on the agents' actions through payments that are conditioned on the project's outcome (rather than the agents' actual actions) and the main challenge is that of determining the Nash equilibrium that maximizes the principal's net utility, referred to as the optimal contract. Babaioff, Feldman and Nisan  suggest and study a basic combinatorial agency model for this setting. Here, we concentrate mainly on two extreme cases: the AND and OR technologies. Our analysis of the OR technology resolves an open question and disproves a conjecture raised in . In particular, we show that while the AND case admits a polynomial-time algorithm, computing the optimal contract in the OR case is NP-hard. On the positive side, we devise an FPTAS for the OR case, which also sheds some light on optimal contract approximation of general technologies.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp452.
Length: 23 pages
Date of creation: May 2007
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2007-05-26 (All new papers)
- NEP-BEC-2007-05-26 (Business Economics)
- NEP-CMP-2007-05-26 (Computational Economics)
- NEP-ICT-2007-05-26 (Information & Communication Technologies)
- NEP-PPM-2007-05-26 (Project, Program & Portfolio Management)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Nisan, Noam & Ronen, Amir, 2001. "Algorithmic Mechanism Design," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 166-196, April.
- Legros, Patrick & Matthews, Steven A, 1993.
"Efficient and Nearly-Efficient Partnerships,"
Review of Economic Studies,
Wiley Blackwell, vol. 60(3), pages 599-611, July.
- Patrick Legros & Steven A. Matthews, 1992. "Efficient and Nearly Efficient Partnerships," Discussion Papers 991R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Patrick Legros & Steven Matthews, 1993. "Efficient and nearly efficient partnerships," ULB Institutional Repository 2013/7040, ULB -- Universite Libre de Bruxelles.
- Mookherjee, Dilip, 1984. "Optimal Incentive Schemes with Many Agents," Review of Economic Studies, Wiley Blackwell, vol. 51(3), pages 433-46, July.
- Eyal Winter, 2003.
"Incentives and Discrimination,"
Discussion Paper Series
dp313, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Babaioff, Moshe & Feldman, Michal & Nisan, Noam & Winter, Eyal, 2012. "Combinatorial agency," Journal of Economic Theory, Elsevier, vol. 147(3), pages 999-1034.
- Roland Strausz, . "Moral Hazard in Sequential Teams," Papers 001, Departmental Working Papers.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ilan Nehama).
If references are entirely missing, you can add them using this form.