{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T09:33:41Z","timestamp":1768728821663,"version":"3.49.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T00:00:00Z","timestamp":1502841600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google Research Grant"},{"name":"Microsoft Research New Faculty Fellowship"},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["AF-0910940"],"award-info":[{"award-number":["AF-0910940"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2016,8,26]]},"abstract":"<jats:p>\n                    Incentives are more likely to elicit desired outcomes when they are designed based on accurate models of agents\u2019 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\n                    <jats:italic toggle=\"yes\">simple<\/jats:italic>\n                    agents\u2014agents 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                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    potential contestants with types (\n                    <jats:italic toggle=\"yes\">\n                      q\n                      <jats:sub>i<\/jats:sub>\n                    <\/jats:italic>\n                    ,\n                    <jats:italic toggle=\"yes\">\n                      c\n                      <jats:sup>i<\/jats:sup>\n                    <\/jats:italic>\n                    ) each choose between participating and producing a submission of quality\n                    <jats:italic toggle=\"yes\">\n                      q\n                      <jats:sup>i<\/jats:sup>\n                    <\/jats:italic>\n                    at cost\n                    <jats:italic toggle=\"yes\">\n                      c\n                      <jats:sup>i<\/jats:sup>\n                    <\/jats:italic>\n                    , versus not participating at all to maximize their utilities. How should a principal distribute a total prize\n                    <jats:italic toggle=\"yes\">V<\/jats:italic>\n                    among the\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    ranks to maximize some increasing function of the qualities of elicited submissions in a contest with such simple agents?\n                  <\/jats:p>\n                  <jats:p>\n                    We first solve the optimal contest design problem for settings where agents have homogenous participation costs\n                    <jats:italic toggle=\"yes\">\n                      c\n                      <jats:sup>i<\/jats:sup>\n                    <\/jats:italic>\n                    =\n                    <jats:italic toggle=\"yes\">c<\/jats:italic>\n                    . Here, the contest that maximizes every increasing function of the elicited contributions is always a simple contest, awarding equal prizes of\n                    <jats:italic toggle=\"yes\">V<\/jats:italic>\n                    \/\n                    <jats:italic toggle=\"yes\">j<\/jats:italic>\n                    * each to the top\n                    <jats:italic toggle=\"yes\">j<\/jats:italic>\n                    *=\n                    <jats:italic toggle=\"yes\">V<\/jats:italic>\n                    \/\n                    <jats:italic toggle=\"yes\">c<\/jats:italic>\n                    \u2212 \u0398(\u221a\n                    <jats:italic toggle=\"yes\">V<\/jats:italic>\n                    \/(\n                    <jats:italic toggle=\"yes\">c<\/jats:italic>\n                    ln (\n                    <jats:italic toggle=\"yes\">V<\/jats:italic>\n                    \/\n                    <jats:italic toggle=\"yes\">c<\/jats:italic>\n                    ))) 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\u2019 effort cost functions. We next address the general case with heterogenous costs where agents\u2019 types (\n                    <jats:italic toggle=\"yes\">\n                      q\n                      <jats:sup>i<\/jats:sup>\n                    <\/jats:italic>\n                    ,\n                    <jats:italic toggle=\"yes\">\n                      c\n                      <jats:sup>i<\/jats:sup>\n                    <\/jats:italic>\n                    ) 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\u2019s objective is to maximize the quality of the best elicited contribution. The proof of this result hinges around a \u201csubequilibrium\u201d lemma establishing a stochastic dominance relation between the distribution of qualities elicited in an equilibrium and a\n                    <jats:italic toggle=\"yes\">subequilibrium<\/jats:italic>\n                    \u2014a 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.\n                  <\/jats:p>","DOI":"10.1145\/2930955","type":"journal-article","created":{"date-parts":[[2016,8,16]],"date-time":"2016-08-16T08:14:20Z","timestamp":1471335260000},"page":"1-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Contest Design for Simple Agents"],"prefix":"10.1145","volume":"4","author":[{"given":"Arpita","family":"Ghosh","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}]}],"member":"320","published-online":{"date-parts":[[2016,8,16]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the International Conference on Information Systems.","author":"Archak N.","unstructured":"N. Archak and A. Sundarajan. 2009. Optimal design of crowdsourcing contests. In Proceedings of the International Conference on Information Systems."},{"key":"e_1_2_1_2_1","volume-title":"Behavioral Game Theory: Experiments in Strategic Interaction","author":"Camerer C.","unstructured":"C. Camerer. 2003. Behavioral Game Theory: Experiments in Strategic Interaction. Princeton University Press, Princeton, NJ."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2343776.2343793"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095185"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1257\/000282803322157025"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566392"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482540.2482571"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187910"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482540.2482585"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187970"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1465-7295.1988.tb01674.x"},{"key":"e_1_2_1_12_1","first-page":"170","article-title":"A further generalization of the Kakutani fixed point theorem, with applications to Nash equilibrium points","volume":"3","author":"Glicksberg I. L.","year":"1952","unstructured":"I. L. Glicksberg. 1952. A further generalization of the Kakutani fixed point theorem, with applications to Nash equilibrium points. Proceedings of the American Mathematical Society 3, 1, 170--174.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1086\/261153"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807376"},{"key":"e_1_2_1_15_1","unstructured":"N. Immorlica N. Stoddard and V. Syrgkanis. 2013. Social status and badge design. arXiv:1312.2299."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753375"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2207798"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082473.1082572"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1086\/261010"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.4.619"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.91.3.542"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.004"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1086\/518010"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_2_1_26_1","first-page":"872","article-title":"Digging for golden carrots: An analysis of research tournaments","volume":"85","author":"Taylor Curtis R.","year":"1995","unstructured":"Curtis R. Taylor. 1995. Digging for golden carrots: An analysis of research tournaments. American Economic Review 85, 4, 872--890.","journal-title":"American Economic Review"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602907"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2930955","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2930955","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2930955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:25:45Z","timestamp":1763457945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2930955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,16]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8,26]]}},"alternative-id":["10.1145\/2930955"],"URL":"https:\/\/doi.org\/10.1145\/2930955","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"value":"2167-8375","type":"print"},{"value":"2167-8383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,16]]},"assertion":[{"value":"2014-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-03-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-08-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}