Affiliation:
1. Cornell University, Ithaca, NY
Abstract
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 (
q
i
,
c
i
) each choose between participating and producing a submission of quality
q
i
at cost
c
i
, 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
c
i
=
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 (
q
i
,
c
i
) 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.
Funder
Google Research Grant
Microsoft Research New Faculty Fellowship
NSF
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Marketing,Economics and Econometrics,Statistics and Probability,Computer Science (miscellaneous)
Reference27 articles.
1. C. Camerer. 2003. Behavioral Game Theory: Experiments in Strategic Interaction. Princeton University Press Princeton NJ. C. Camerer. 2003. Behavioral Game Theory: Experiments in Strategic Interaction. Princeton University Press Princeton NJ.
2. Optimal Design of Research Contests
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Costly information providing in binary contests;Annals of Mathematics and Artificial Intelligence;2024-07-27
2. Contest partitioning in binary contests;Autonomous Agents and Multi-Agent Systems;2024-02-27
3. Tractable Binary Contests;ACM Transactions on Economics and Computation;2023-10-26
4. Obtaining and Providing Partial Information in Binary Contests;2022 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT);2022-11
5. Social Sourcing: Incorporating Social Networks Into Crowdsourcing Contest Design;IEEE/ACM Transactions on Networking;2022