{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T04:09:03Z","timestamp":1785038943603,"version":"3.55.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031432538","type":"print"},{"value":"9783031432545","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43254-5_5","type":"book-chapter","created":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:04:03Z","timestamp":1693782243000},"page":"71-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Contest Game for\u00a0Crowdsourcing Reviews"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0115-3045","authenticated-orcid":false,"given":"Marios","family":"Mavronicolas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-3749","authenticated-orcid":false,"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,4]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abbassi, Z., Hedge, N., Massouli\u00e9, L.: Distributed content curation on the web. ACM Trans. Internet Technol. 14(2\u20133) (2014). Article 9","DOI":"10.1145\/2663489"},{"issue":"7","key":"5_CR2","doi-asserted-by":"publisher","first-page":"4755","DOI":"10.1287\/mnsc.2021.4095","volume":"68","author":"N Armosti","year":"2022","unstructured":"Armosti, N., Weinberg, S.M.: Bitcoin: a natural oligopoly. Manage. Sci. 68(7), 4755\u20134771 (2022)","journal-title":"Manage. Sci."},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01211819","volume":"8","author":"MR Baye","year":"1996","unstructured":"Baye, M.R., Kovenock, D., De Vries, C.G.: The all-pay auction with complete information. Econ. Theor. 8(2), 291\u2013305 (1996)","journal-title":"Econ. Theor."},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"2813","DOI":"10.1287\/mnsc.2020.3666","volume":"67","author":"G Benad\u00e8","year":"2021","unstructured":"Benad\u00e8, G., Nath, S., Procaccia, A., Shah, N.: Preference elicitation for participatory budgeting. Manage. Sci. 67(5), 2813\u20132827 (2021)","journal-title":"Manage. Sci."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2022.10.043","volume":"940","author":"V Bil\u00f2","year":"2023","unstructured":"Bil\u00f2, V., Gourv\u00e9s, L., Monnot, J.: Project games. Theoret. Comput. Sci. 940, 97\u2013111 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Birmpas, G., Kovalchuk, L., Lazos, P., Oliynykov, R.: Parallel contests for crowdsourcing reviews: existence and quality of equilibria. In: Proceedings of the 4th ACM Conference on Financial Technologies, pp. 268\u2013280 (2022)","DOI":"10.1145\/3558535.3559776"},{"key":"5_CR7","unstructured":"Charalambides, Ch.A.: Enumerative Combinatorics. Chapman & Hall\/CRC, Boca Raton (2002)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.geb.2015.09.001","volume":"113","author":"S Chawla","year":"2019","unstructured":"Chawla, S., Hartline, J.D., Sivan, B.: Optimal crowdsourcing contests. Games Econ. Behav. 113, 80\u201396 (2019)","journal-title":"Games Econ. Behav."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Chen, M., Tang, P., Wang, Z., Xiao, S., Yang, X.: Optimal anonymous independent reward scheme design. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence, pp. 165\u2013171 (2022)","DOI":"10.24963\/ijcai.2022\/24"},{"key":"5_CR10","unstructured":"Cheng, Y., Deng, X., Qi, Q., Yan, X.: Truthfulness of a proportional sharing mechanism in resource exchange. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, pp. 187\u2013193 (2016)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, C., Sela, A.: Contests with ties. B. E. J. Theoret. Econ. 7 (2007). Article 43","DOI":"10.2202\/1935-1704.1398"},{"key":"5_CR12","unstructured":"Deng, X., Li, N., Li, W., Qi, Q.: Competition among parallel contests. ArXiv:2210.06866, October 2022"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Di Palantino, D., Vojnovic\u0300, M.: Crowdsourcing and all-pay auctions. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 119\u2013128 (2009)","DOI":"10.1145\/1566374.1566392"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Easley, D., Ghosh, A.: Incentives, gamification, and game theory: an economic approach to badge design. ACM Trans. Econ. Comput. 4(3), 16.1\u201316.26 (2016)","DOI":"10.1145\/2910575"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Elkind, E., Ghosh, A., Goldberg, P.W.: Contest design with threshold objectives. In: Proceedings of the 17th Conference on Web and Internet Economics, p. 554, December 2021. Also: arXiv:2109.03179v2","DOI":"10.2139\/ssrn.4155267"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Elkind, E., Ghosh, A., Goldberg, P.W.: Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy. In: Proceedings of the 15th International Symposium on Algorithmic Game Theory, pp. 133\u2013150, September 2022","DOI":"10.1007\/978-3-031-15714-1_8"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Elkind, E., Ghosh, A., Goldberg, P.: Contests to incentivize a target group. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence, pp. 279\u2013285, July 2022","DOI":"10.24963\/ijcai.2022\/40"},{"issue":"8","key":"5_CR18","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TPDS.2008.168","volume":"20","author":"M Feldmann","year":"2009","unstructured":"Feldmann, M., Lai, K., Zhang, L.: The proportional share allocation market for computational resources. IEEE Trans. Parallel Distrib. Syst. 20(8), 1075\u20131088 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00224-007-9015-8","volume":"42","author":"M Gairing","year":"2008","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish routing with incomplete information. Theory Comput. Syst. 42(1), 91\u2013130 (2008)","journal-title":"Theory Comput. Syst."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Routing (Un-)splittable flow in games with player-specific affine latency functions. ACM Trans. Algorithms 7(3) (2011). Article 31","DOI":"10.1145\/1978782.1978786"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Ghosh, A., McAfee, P.: Incentivizing high-quality user-generated content. In: Proceedings of the 20th International Conference on World Wide Web, pp. 137\u2013146 (2011)","DOI":"10.1145\/1963405.1963428"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.geb.2012.11.003","volume":"86","author":"S Jain","year":"2014","unstructured":"Jain, S., Chen, Y., Parkes, D.C.: Designing incentives for question-and-answer forums. Games Econom. Behav. 86, 458\u2013474 (2014)","journal-title":"Games Econom. Behav."},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1287\/moor.1040.0091","volume":"29","author":"R Johari","year":"2004","unstructured":"Johari, R., Tsitsiklis, J.N.: Efficiency loss in a network resource allocation game. Math. Oper. Res. 29(3), 402\u2013435 (2004)","journal-title":"Math. Oper. Res."},{"key":"5_CR24","volume-title":"Game Theory","author":"A Karlin","year":"2017","unstructured":"Karlin, A., Peres, Y.: Game Theory. American Mathematical Society, Alive (2017)"},{"issue":"1","key":"5_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2637364.2592010","volume":"42","author":"A May","year":"2014","unstructured":"May, A., Chaintreau, A., Korula, N., Lattanzi, S.: Filter & follow: how social media foster content curation. ACM SIGMETRICS Perform. Eval. Rev. 42(1), 43\u201355 (2014)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games Econom. Behav. 13(1), 111\u2013124 (1996)","journal-title":"Games Econom. Behav."},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econom. Behav. 14(1), 124\u2013143 (1996)","journal-title":"Games Econom. Behav."},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Murota, K.: Discrete Convex Analysis, SIAM Monographs on Discrete Mathematics and Applications, vol. 10 (2003)","DOI":"10.1137\/1.9780898718508"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.geb.2014.09.005","volume":"88","author":"D P\u00e1lv\u00f6lgyi","year":"2014","unstructured":"P\u00e1lv\u00f6lgyi, D., Peters, H., Vermeulen, D.: A strategic approach to multiple estate division problems. Games Econom. Behav. 88, 135\u2013152 (2014)","journal-title":"Games Econom. Behav."},{"key":"5_CR30","unstructured":"Quint, Th., Shubik, M.: A Model of Migration, Cowles Foundation Discussion Paper 1088, Yale University (1994)"},{"issue":"1","key":"5_CR31","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. Internat. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Internat. J. Game Theory"},{"issue":"4","key":"5_CR32","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S Sahni","year":"1974","unstructured":"Sahni, S.: Computationally related problems. SIAM J. Comput. 3(4), 262\u2013279 (1974)","journal-title":"SIAM J. Comput."},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Segev, E.: Crowdsourcing contests. Eur. J. Oper. Res. 281, 241\u2013255 (2020)","DOI":"10.1016\/j.ejor.2019.02.057"},{"key":"5_CR34","unstructured":"Shapley, L.: A value for $$n$$-player games. In: Kuhn, H., Tucker, A. (eds.) Contributions to the Theory of Games. Princeton University Press (1962)"},{"issue":"3","key":"5_CR35","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1287\/mnsc.8.3.325","volume":"8","author":"M Shubick","year":"1962","unstructured":"Shubick, M.: Incentives, decentralized control, the assignment of joint costs and internal pricing. Manage. Sci. 8(3), 325\u2013343 (1962)","journal-title":"Manage. Sci."},{"issue":"1","key":"5_CR36","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3982\/ECTA7537","volume":"77","author":"R Siegel","year":"2009","unstructured":"Siegel, R.: All-pay auctions. Econometrica 77(1), 71\u201392 (2009)","journal-title":"Econometrica"},{"issue":"2","key":"5_CR37","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF01213906","volume":"7","author":"S Skaperdas","year":"1996","unstructured":"Skaperdas, S.: Contest success functions. Econ. Theor. 7(2), 283\u2013290 (1996)","journal-title":"Econ. Theor."},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Vetta, A.: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 416\u2013425 (2002)","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Vojnovic\u0300, M.: Contest Theory - Incentive Mechanisms and Ranking Methods, Cambridge University Press, Cambridge (2015)","DOI":"10.1017\/CBO9781139519366"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Xia, Y., Qin, T., Yu, N., Liu, T.Y.: Incentivizing high-quality content from heterogeneous users: on the existence of nash equilibrium. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 819\u2013825 (2014). Also: arXiv:1404.5155v1","DOI":"10.1609\/aaai.v28i1.8824"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, L.: The efficiency and fairness of a fixed budget resource allocation game. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, pp. 485\u2013496 (2005)","DOI":"10.1007\/11523468_40"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43254-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T11:26:21Z","timestamp":1730028381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43254-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432538","9783031432545"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43254-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}