TY - GEN
T1 - Free-riding and free-labor in combinatorial agency
AU - Babaioff, Moshe
AU - Feldman, Michal
AU - Nisan, Noam
PY - 2009
Y1 - 2009
N2 - This paper studies a setting where a principal needs to motivate teams of agents whose efforts lead to an outcome that stochastically depends on the combination of agents' actions, which are not directly observable by the principal. In [1] we suggest and study a basic "combinatorial agency" model for this setting. In this paper we expose a somewhat surprising phenomenon found in this setting: cases where the principal can gain by asking agents to reduce their effort level, even when this increased effort comes for free. This phenomenon cannot occur in a setting where the principal can observe the agents' actions, but we show that it can occur in the hidden-actions setting. We prove that for the family of technologies that exhibit "increasing returns to scale" this phenomenon cannot happen, and that in some sense this is a maximal family of technologies for which the phenomenon cannot occur. Finally, we relate our results to a basic question in production design in firms.
AB - This paper studies a setting where a principal needs to motivate teams of agents whose efforts lead to an outcome that stochastically depends on the combination of agents' actions, which are not directly observable by the principal. In [1] we suggest and study a basic "combinatorial agency" model for this setting. In this paper we expose a somewhat surprising phenomenon found in this setting: cases where the principal can gain by asking agents to reduce their effort level, even when this increased effort comes for free. This phenomenon cannot occur in a setting where the principal can observe the agents' actions, but we show that it can occur in the hidden-actions setting. We prove that for the family of technologies that exhibit "increasing returns to scale" this phenomenon cannot happen, and that in some sense this is a maximal family of technologies for which the phenomenon cannot occur. Finally, we relate our results to a basic question in production design in firms.
UR - http://www.scopus.com/inward/record.url?scp=71549139753&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-04645-2_11
DO - 10.1007/978-3-642-04645-2_11
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:71549139753
SN - 3642046444
SN - 9783642046445
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 109
EP - 121
BT - Algorithmic Game Theory - Second International Symposium, SAGT 2009, Proceedings
T2 - 2nd International Symposium on Algorithmic Game Theory, SAGT 2009
Y2 - 18 October 2009 through 20 October 2009
ER -