Optimal Contest Design for Simple Agents

Incentives are more likely to elicit desired outcomes when they are designed based on accurate models of agents’ strategic behavior. A growing literature, however, suggests that people do not quite behave like standard economic agents in a variety of environments, both online and offline. What consequences might such differences have for the optimal design of mechanisms in these environments? In this article, we explore this question in the context of optimal contest design for simple agents—agents who strategically reason about whether or not to participate in a system, but not about the input they provide to it. Specifically, consider a contest where n potential contestants with types (qi, ci) each choose between participating and producing a submission of quality qi at cost ci, versus not participating at all to maximize their utilities. How should a principal distribute a total prize V among the n ranks to maximize some increasing function of the qualities of elicited submissions in a contest with such simple agents? We first solve the optimal contest design problem for settings where agents have homogenous participation costs ci = c. Here, the contest that maximizes every increasing function of the elicited contributions is always a simple contest, awarding equal prizes of V/j* each to the top j*=V/c − Θ(√V/(c ln (V/c))) contestants. This is in contrast to the optimal contest structure in comparable models with strategic effort choices, where the optimal contest is either a winner-take-all contest or awards possibly unequal prizes, depending on the curvature of agents’ effort cost functions. We next address the general case with heterogenous costs where agents’ types (qi, ci) are inherently two dimensional, significantly complicating equilibrium analysis. With heterogenous costs, the optimal contest depends on the objective being maximized: our main result here is that the winner-take-all contest is a 3-approximation of the optimal contest when the principal’s objective is to maximize the quality of the best elicited contribution. The proof of this result hinges around a “subequilibrium” lemma establishing a stochastic dominance relation between the distribution of qualities elicited in an equilibrium and a subequilibrium—a strategy profile that is a best response for all agents who choose to participate in that strategy profile; this relation between equilibria and subequilibria may be of more general interest.

[1]  Milan Vojnovic,et al.  Crowdsourcing and all-pay auctions , 2009, EC '09.

[2]  E. Lazear,et al.  Rank-Order Tournaments as Optimum Labor Contracts , 1979, Journal of Political Economy.

[3]  E. Samuel-Cahn Comparison of Threshold Stop Rules and Maximum for Independent Nonnegative Random Variables , 1984 .

[4]  Lydia B. Chilton,et al.  The labor economics of paid crowdsourcing , 2010, EC '10.

[5]  Colin Camerer Behavioral Game Theory: Experiments in Strategic Interaction , 2003 .

[6]  R. Preston McAfee,et al.  Crowdsourcing with endogenous entry , 2012, WWW.

[7]  I. Glicksberg A FURTHER GENERALIZATION OF THE KAKUTANI FIXED POINT THEOREM, WITH APPLICATION TO NASH EQUILIBRIUM POINTS , 1952 .

[8]  P. Resnick,et al.  Building Successful Online Communities: Evidence-Based Social Design , 2012 .

[9]  Arpita Ghosh,et al.  Incentives, gamification, and game theory: an economic approach to badge design , 2013, EC '13.

[10]  Curtis R. Taylor Digging for golden carrots: an analysis of research tournaments , 1995 .

[11]  Balasubramanian Sivan,et al.  Optimal Crowdsourcing Contests , 2011, Encyclopedia of Algorithms.

[12]  Arpita Ghosh,et al.  Privacy and coordination: computing on databases with endogenous participation , 2013, EC '13.

[13]  B. Moldovanu,et al.  The Optimal Allocation of Prizes in Contests , 2001 .

[14]  Nicole Immorlica,et al.  Social Status and Badge Design , 2015, WWW.

[15]  Robert J. Weber,et al.  Distributional Strategies for Games with Incomplete Information , 1985, Math. Oper. Res..

[16]  Benny Moldovanu,et al.  Contest architecture , 2006, J. Econ. Theory.

[17]  Yan Chen,et al.  Re-examining price as a predictor of answer quality in an online q&a site , 2010, CHI.

[18]  Ruggiero Cavallo,et al.  Efficient crowdsourcing contests , 2012, AAMAS.

[19]  ConitzerVincent,et al.  The ACM transactions on economics and computation , 2013 .

[20]  Kevin Leyton-Brown,et al.  Level-0 meta-models for predicting human behavior in games , 2014, EC.

[21]  Nancy L. Stokey,et al.  A Comparison of Tournaments and Contracts , 1983, Journal of Political Economy.

[22]  Arun Sundararajan,et al.  Optimal Design of Crowdsourcing Contests , 2009, ICIS.

[23]  B. Moldovanu,et al.  Contests for Status , 2005, Journal of Political Economy.

[24]  Patrick Hummel,et al.  Implementing optimal outcomes in social computing: a game-theoretic approach , 2012, WWW.

[25]  Tuomas Sandholm,et al.  Mechanism design and deliberative agents , 2005, AAMAS '05.

[26]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[27]  Arpita Ghosh,et al.  Optimal contest design for simple agents , 2014, EC.