{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T12:47:55Z","timestamp":1767876475893,"version":"3.49.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T00:00:00Z","timestamp":1465948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2016,6,15]]},"abstract":"<jats:p>\n            Gamification is growing increasingly prevalent as a means to incentivize user engagement of social media sites that rely on user contributions.\n            <jats:italic>Badges<\/jats:italic>\n            , or equivalent rewards, such as top-contributor lists that are used to recognize a user's contributions on a site, clearly appear to be valued by users who actively pursue and compete for them. However, different sites use different badge\n            <jats:italic>designs<\/jats:italic>\n            , varying how, and for what, badges are awarded. Some sites, such as StackOverflow, award badges for meeting fixed levels of contribution. Other sites, such as Amazon and Y! Answers, reward users for being among some top set of contributors on the site, corresponding to a competitive standard of performance. Given that users value badges, and that contributing to a site requires effort, how badges are designed will affect the incentives\u2014therefore the participation and effort\u2014elicited from strategic users on a site.\n          <\/jats:p>\n          <jats:p>\n            We take a game-theoretic approach to badge design, analyzing the incentives created by widely used badge designs in a model in which winning a badge is valued, effort is costly, and potential contributors to the site endogenously decide whether or not to participate, and how much total effort to put into their contributions to the site. We analyze equilibrium existence, as well as equilibrium participation and effort, in an absolute standards mechanism\n            <jats:italic>M<\/jats:italic>\n            <jats:sub>\u03b1<\/jats:sub>\n            in which badges are awarded for meeting some\n            <jats:italic>absolute<\/jats:italic>\n            level of (observed) effort, and a\n            <jats:italic>relative<\/jats:italic>\n            standards mechanism\n            <jats:italic>M<\/jats:italic>\n            <jats:sub>\u03c1<\/jats:sub>\n            corresponding to competitive standards, as in a top-\u03c1 contributor badge. We find that equilibria always exist in both mechanisms, even when the value from winning a badge depends endogenously on the number of other winners. However,\n            <jats:italic>M<\/jats:italic>\n            <jats:sub>\u03b1<\/jats:sub>\n            has zero-participation equilibria for standards that are too high, whereas all equilibria in\n            <jats:italic>M<\/jats:italic>\n            <jats:sub>\u03c1<\/jats:sub>\n            elicit nonzero participation for all possible \u03c1,\n            <jats:italic>provided<\/jats:italic>\n            that \u03c1 is specified as a fixed number rather than as a fraction of actual contributors (note that the two are not equivalent in a setting with endogenous participation). Finally, we ask whether or not a site should explicitly announce the number of users winning a badge. The answer to this question is determined by the curvature of the value of winning the badge as a function of the number of other winners.\n          <\/jats:p>","DOI":"10.1145\/2910575","type":"journal-article","created":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T19:32:01Z","timestamp":1466019121000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Incentives, Gamification, and Game Theory: An Economic Approach to Badge Design"],"prefix":"10.1145","volume":"4","author":[{"given":"David","family":"Easley","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}]},{"given":"Arpita","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}]}],"member":"320","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488398"},{"key":"e_1_2_1_2_1","volume-title":"ACM Conference on Human Factors in Computing Systems (CHI'11)","author":"Antin J."},{"key":"e_1_2_1_3_1","volume-title":"International Conference on Information Systems.","author":"Archak N."},{"key":"e_1_2_1_4_1","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA'12)","author":"Chawla S."},{"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.1566393"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/105051606000000673"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993603"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187910"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422465"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963428"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187970"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_40"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(85)90059-6"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1086\/261010"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.91.3.542"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.2045954"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378704.1378719"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2910575","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2910575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:09Z","timestamp":1750221549000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2910575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,15]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6,15]]}},"alternative-id":["10.1145\/2910575"],"URL":"https:\/\/doi.org\/10.1145\/2910575","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"value":"2167-8375","type":"print"},{"value":"2167-8383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,15]]},"assertion":[{"value":"2014-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}