{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:45Z","timestamp":1767340305263,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,9,19]]},"DOI":"10.1145\/3558535.3559776","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:54:17Z","timestamp":1688568857000},"page":"268-280","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4733-7885","authenticated-orcid":false,"given":"Georgios","family":"Birmpas","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lyudmila","family":"Kovalchuk","sequence":"additional","affiliation":[{"name":"Input Output, National Technical University of Ukraine, Kyiv, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Lazos","sequence":"additional","affiliation":[{"name":"Input Output, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Oliynykov","sequence":"additional","affiliation":[{"name":"Input Output and V.N.Karazin Kharkiv National University, Kharkiv, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_29"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71924-5_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.36"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/589"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-015-9667-8"},{"key":"e_1_3_2_1_6_1","first-page":"200","volume-title":"Proceedings of the International Conference on Information Systems, ICIS 2009","author":"Archak N.","year":"2009","unstructured":"Archak , N. , and Sundararajan , A . Optimal design of crowdsourcing contests . In Proceedings of the International Conference on Information Systems, ICIS 2009 , Phoenix, Arizona, USA, December 15--18 , 2009 (2009), J. F. N. Jr. and W. L. Currie, Eds., Association for Information Systems, p. 200 . Archak, N., and Sundararajan, A. Optimal design of crowdsourcing contests. In Proceedings of the International Conference on Information Systems, ICIS 2009, Phoenix, Arizona, USA, December 15--18, 2009 (2009), J. F. N. Jr. and W. L. Currie, Eds., Association for Information Systems, p. 200."},{"key":"e_1_3_2_1_7_1","volume-title":"10th Innovations in Theoretical Computer Science Conference, ITCS 2019","author":"Arnosti N.","year":"2019","unstructured":"Arnosti , N. , and Weinberg , S. M . Bitcoin: A natural oligopoly . In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019 , January 10 --12 , 2019 , San Diego, California, USA (2019), A. Blum, Ed., vol. 124 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 5:1--5:1. Arnosti, N., and Weinberg, S. M. Bitcoin: A natural oligopoly. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10--12, 2019, San Diego, California, USA (2019), A. Blum, Ed., vol. 124 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 5:1--5:1."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.830164"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45046-4_4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3666"},{"key":"e_1_3_2_1_11_1","volume-title":"CIAC 2019, Rome, Italy, May 27--29, 2019, Proceedings","volume":"11485","author":"Bil\u00f2 V.","year":"2019","unstructured":"Bil\u00f2 , V. , Gourv\u00e8s , L. , and Monnot , J . Project games. In Algorithms and Complexity - 11th International Conference , CIAC 2019, Rome, Italy, May 27--29, 2019, Proceedings ( 2019 ), P. Heggernes, Ed. , vol. 11485 of Lecture Notes in Computer Science, Springer, pp. 75--86. Bil\u00f2, V., Gourv\u00e8s, L., and Monnot, J. Project games. In Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27--29, 2019, Proceedings (2019), P. Heggernes, Ed., vol. 11485 of Lecture Notes in Computer Science, Springer, pp. 75--86."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3398761.3398985"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2015.09.001"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566392"},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","volume-title":"Web and Internet Economics - 17th International Conference, WINE","author":"Elkind E.","year":"2021","unstructured":"Elkind , E. , Ghosh , A. , and Goldberg , P. W . Contest design with threshold objectives . In Web and Internet Economics - 17th International Conference, WINE 2021 , Potsdam, Germany, December 14--17, 2021, Proceedings (2021), vol. 13112 of Lecture Notes in Computer Science , Springer , p. 554. Elkind, E., Ghosh, A., and Goldberg, P. W. Contest design with threshold objectives. In Web and Internet Economics - 17th International Conference, WINE 2021, Potsdam, Germany, December 14--17, 2021, Proceedings (2021), vol. 13112 of Lecture Notes in Computer Science, Springer, p. 554."},{"key":"e_1_3_2_1_16_1","volume-title":"Simultaneous contests with equal sharing allocation of prizes: Computational complexity and price of anarchy. arXiv preprint arXiv:2207.08151","author":"Elkind E.","year":"2022","unstructured":"Elkind , E. , Ghosh , A. , and Goldberg , P. W . Simultaneous contests with equal sharing allocation of prizes: Computational complexity and price of anarchy. arXiv preprint arXiv:2207.08151 ( 2022 ). Elkind, E., Ghosh, A., and Goldberg, P. W. Simultaneous contests with equal sharing allocation of prizes: Computational complexity and price of anarchy. arXiv preprint arXiv:2207.08151 (2022)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.12.008"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1465-7295.1988.tb01674.x"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1609\/hcomp.v2i1.13158"},{"key":"e_1_3_2_1_20_1","volume-title":"25th Annual European Symposium on Algorithms, ESA 2017","volume":"87","author":"Gollapudi S.","year":"2017","unstructured":"Gollapudi , S. , Kollias , K. , Panigrahi , D. , and Pliatsika , V . Profit sharing and efficiency in utility games . In 25th Annual European Symposium on Algorithms, ESA 2017 , September 4 --6 , 2017 , Vienna, Austria (2017), K. Pruhs and C. Sohler, Eds., vol. 87 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 43:1--43:14. Gollapudi, S., Kollias, K., Panigrahi, D., and Pliatsika, V. Profit sharing and efficiency in utility games. In 25th Annual European Symposium on Algorithms, ESA 2017, September 4--6, 2017, Vienna, Austria (2017), K. Pruhs and C. Sohler, Eds., vol. 87 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 43:1--43:14."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329586"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2009.04.002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00781-9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837029"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.91.3.542"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_3_2_1_27_1","unstructured":"Nakamoto S. Bitcoin: A peer-to-peer electronic cash system.  Nakamoto S. Bitcoin: A peer-to-peer electronic cash system."},{"key":"e_1_3_2_1_28_1","first-page":"861","volume-title":"International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '14","author":"Polevoy G.","year":"2014","unstructured":"Polevoy , G. , Trajanovski , S. , and de Weerdt , M. Nash equilibria in shared effort games . In International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '14 , Paris, France, May 5--9 , 2014 (2014), A. L. C. Bazzan, M. N. Huhns, A. Lomuscio, and P. Scerri, Eds., IFAAMAS\/ACM, pp. 861 -- 868 . Polevoy, G., Trajanovski, S., and de Weerdt, M. Nash equilibria in shared effort games. In International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '14, Paris, France, May 5--9, 2014 (2014), A. L. C. Bazzan, M. N. Huhns, A. Lomuscio, and P. Scerri, Eds., IFAAMAS\/ACM, pp. 861--868."},{"key":"e_1_3_2_1_29_1","first-page":"1","article-title":"All-pay contests","volume":"77","author":"Siegel R","year":"2009","unstructured":"Siegel , R . All-pay contests . Econometrica 77 , 1 ( 2009 ), 71--92. Siegel, R. All-pay contests. Econometrica 77, 1 (2009), 71--92.","journal-title":"Econometrica"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.78"},{"issue":"4","key":"e_1_3_2_1_31_1","first-page":"872","article-title":"Digging for golden carrots: an analysis of research tournaments","volume":"85","author":"Taylor C","year":"1995","unstructured":"Taylor , C . Digging for golden carrots: an analysis of research tournaments . American Economic Review 85 ( 4 ) ( 1995 ), 872 -- 890 . Taylor, C. Digging for golden carrots: an analysis of research tournaments. American Economic Review 85(4) (1995), 872--90.","journal-title":"American Economic Review"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"e_1_3_2_1_33_1","volume-title":"Contest Theory: Incentive Mechanisms and Ranking Methods","author":"Vojnovic M.","year":"2016","unstructured":"Vojnovic , M. Contest Theory: Incentive Mechanisms and Ranking Methods . Cambridge University Press , 2016 . Vojnovic, M. Contest Theory: Incentive Mechanisms and Ranking Methods. Cambridge University Press, 2016."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2019.23024"}],"event":{"name":"AFT '22: 4th ACM Conference on Advances in Financial Technologies","acronym":"AFT '22","location":"Cambridge MA USA"},"container-title":["Proceedings of the 4th ACM Conference on Advances in Financial Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558535.3559776","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558535.3559776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:09Z","timestamp":1750178829000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558535.3559776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":34,"alternative-id":["10.1145\/3558535.3559776","10.1145\/3558535"],"URL":"https:\/\/doi.org\/10.1145\/3558535.3559776","relation":{},"subject":[],"published":{"date-parts":[[2022,9,19]]},"assertion":[{"value":"2023-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}