{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:27:39Z","timestamp":1778498859480,"version":"3.51.4"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031157134","type":"print"},{"value":"9783031157141","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15714-1_8","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:26:44Z","timestamp":1663090004000},"page":"133-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Simultaneous Contests with\u00a0Equal Sharing Allocation of\u00a0Prizes: Computational Complexity and\u00a0Price of\u00a0Anarchy"],"prefix":"10.1007","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abheek","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul W.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.econlet.2009.06.025","volume":"105","author":"T Adamo","year":"2009","unstructured":"Adamo, T., Matros, A.: A Blotto game with incomplete information. Econ. Lett. 105(1), 100\u2013102 (2009)","journal-title":"Econ. Lett."},{"key":"8_CR2","unstructured":"Amann, E., Qiao, H.: Parallel contests. Technical report, Thurgauer Wirtschaftsinstitut, University of Konstanz (2008)"},{"key":"8_CR3","unstructured":"Archak, N., Sundararajan, A.: Optimal design of crowdsourcing contests. In: ICIS 2009 (2009)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Babichenko, Y., Rubinstein, A.: Settling the complexity of Nash equilibrium in congestion games. In: STOC 2021, pp. 1426\u20131437 (2021)","DOI":"10.1145\/3406325.3451039"},{"issue":"7","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1287\/mnsc.1100.1176","volume":"56","author":"R Bapna","year":"2010","unstructured":"Bapna, R., Dellarocas, C., Rice, S.: Vertically differentiated simultaneous Vickrey auctions: theory and experimental evidence. Manag. Sci. 56(7), 1074\u20131092 (2010)","journal-title":"Manag. Sci."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Bellman, R.: On \u201ccolonel Blotto\u201d and analogous games. SIAM Rev. 11(1), 66\u201368 (1969)","DOI":"10.1137\/1011006"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Gourv\u00e8s, L., Monnot, J.: Project games. In: CIAC 2019, pp. 75\u201386 (2019)","DOI":"10.1007\/978-3-030-17402-6_7"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Birmpas, G., Kovalchuk, L., Lazos, P., Oliynykov, R.: Parallel contests for crowdsourcing reviews: existence and quality of equilibria. arXiv preprint arXiv:2202.04064 (2022)","DOI":"10.1145\/3558535.3559776"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/nav.3800010109","volume":"1","author":"DW Blackett","year":"1954","unstructured":"Blackett, D.W.: Some Blotto games. Naval Res. Logist. Q. 1(1), 55\u201360 (1954)","journal-title":"Naval Res. Logist. Q."},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/nav.3800050203","volume":"5","author":"DW Blackett","year":"1958","unstructured":"Blackett, D.W.: Pure strategy solutions of Blotto games. Naval Res. Logist. Q. 5(2), 107\u2013109 (1958)","journal-title":"Naval Res. Logist. Q."},{"key":"8_CR11","unstructured":"Borel, E., Ville, J.: Application de la th\u00e9orie des probabiliti\u00e9s aux jeux de hasard, Gauthier-Villars; reprinted in Borel, E., & Ch\u00e9ron, A. (1991). Th\u00e9orie mathematique du bridge \u00e0 la port\u00e9e de tous, Editions Jacques Gabay (1938)"},{"key":"8_CR12","first-page":"1304","volume":"173","author":"E Borel","year":"1921","unstructured":"Borel, E.: La th\u00e9orie du jeu et les \u00e9quations int\u00e9grales \u00e0 noyau sym\u00e9trique gauche. Comptes rendus de l\u2019Acad\u00e9mie des Sciences 173, 1304\u20131308 (1921)","journal-title":"Comptes rendus de l\u2019Acad\u00e9mie des Sciences"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X Chen","year":"2009","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the complexity of computing two-player Nash equilibria. J. ACM (JACM) 56(3), 1\u201357 (2009)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"DiPalantino, D., Vojnovic, M.: Crowdsourcing and all-pay auctions. In: ACM EC 2009, pp. 119\u2013128 (2009)","DOI":"10.1145\/1566374.1566392"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Elkind, E., Ghosh, A., Goldberg, P.: Contest design with threshold objectives. In: WINE 2021, p. 554 (2021). arXiv preprint arXiv:2109.03179","DOI":"10.2139\/ssrn.4155267"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: STOC 2004, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Fearnley, J., Goldberg, P.W., Hollender, A., Savani, R.: The complexity of gradient descent: CLS=PPAD$$\\cap $$PLS. In: STOC 2021, pp. 46\u201359 (2021)","DOI":"10.1145\/3406325.3451052"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Feldman, M., Lai, K., Zhang, L.: A price-anticipating resource allocation mechanism for distributed shared clusters. In: ACM EC 2005, pp. 127\u2013136 (2005)","DOI":"10.1145\/1064009.1064023"},{"key":"8_CR20","unstructured":"Gross, O., Wagner, R.: A continuous colonel Blotto game. Technical report, RAND Project Air Force Santa Monica CA (1950)"},{"issue":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s00182-007-0099-9","volume":"36","author":"S Hart","year":"2008","unstructured":"Hart, S.: Discrete colonel Blotto and general lotto games. Int. J. Game Theory 36(3), 441\u2013460 (2008)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00182-011-0288-4","volume":"41","author":"R Hortala-Vallve","year":"2012","unstructured":"Hortala-Vallve, R., Llorente-Saguer, A.: Pure strategy Nash equilibria in non-zero sum colonel Blotto games. Int. J. Game Theory 41(2), 331\u2013343 (2012)","journal-title":"Int. J. Game Theory"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Stoddard, G., Syrgkanis, V.: Social status and badge design. In: WWW 2015, pp. 473\u2013483 (2015)","DOI":"10.1145\/2736277.2741664"},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37(1), 79\u2013100 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR25","unstructured":"Lakhani, K.R., Garvin, D.A., Lonstein, E.: Topcoder (a): developing software through crowdsourcing. Harvard Business School General Management Unit Case (610\u2013032) (2010)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"May, A., Chaintreau, A., Korula, N., Lattanzi, S.: Filter & follow: how social media foster content curation. In: SIGMETRICS 2014, pp. 43\u201355 (2014)","DOI":"10.1145\/2637364.2592010"},{"issue":"1","key":"8_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."},{"issue":"3","key":"8_CR28","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498\u2013532 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_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."},{"issue":"1","key":"8_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00199-005-0071-5","volume":"29","author":"B Roberson","year":"2006","unstructured":"Roberson, B.: The colonel Blotto game. Econ. Theor. 29(1), 1\u201324 (2006)","journal-title":"Econ. Theor."},{"issue":"1","key":"8_CR31","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"AA Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A.: Simple local search problems that are hard to solve. SIAM J. Comput. 20(1), 56\u201387 (1991)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"8_CR32","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1002\/nav.3800280210","volume":"28","author":"M Shubik","year":"1981","unstructured":"Shubik, M., Weber, R.J.: Systems defense games: colonel Blotto, command and control. Naval Res. Logist. Q. 28(2), 281\u2013287 (1981)","journal-title":"Naval Res. Logist. Q."},{"issue":"1","key":"8_CR33","first-page":"73","volume":"17","author":"JW Tukey","year":"1949","unstructured":"Tukey, J.W.: A problem of strategy. Econometrica 17(1), 73 (1949)","journal-title":"Econometrica"},{"key":"8_CR34","unstructured":"Tullock, G.: Efficient rent-seeking. In: Buchanan, J., Tollison, R., Tullock, G. (eds.) Toward a Theory of the Rent Seeking Society, pp. 131\u2013146. Texas A & M University, College Station (1980)"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Vetta, A.: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: FOCS 2002, pp. 416\u2013425 (2002)","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"8_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139519366","volume-title":"Contest Theory: Incentive Mechanisms and Ranking Methods","author":"M Vojnovi\u0107","year":"2015","unstructured":"Vojnovi\u0107, M.: Contest Theory: Incentive Mechanisms and Ranking Methods. Cambridge University Press, Cambridge (2015)"},{"issue":"3","key":"8_CR37","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1287\/opre.1120.1142","volume":"61","author":"A Washburn","year":"2013","unstructured":"Washburn, A.: Blotto politics. Oper. Res. 61(3), 532\u2013543 (2013)","journal-title":"Oper. Res."},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Yang, J., Adamic, L.A., Ackerman, M.S.: Crowdsourcing and knowledge sharing: strategic user behavior on Taskcn. In: ACM EC 2008, pp. 246\u2013255 (2008)","DOI":"10.1145\/1386790.1386829"},{"key":"8_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/11523468_40","volume-title":"Automata, Languages and Programming","author":"L Zhang","year":"2005","unstructured":"Zhang, L.: The efficiency and fairness of a fixed budget resource allocation game. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 485\u2013496. Springer, Heidelberg (2005). https:\/\/doi.org\/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-15714-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T20:10:18Z","timestamp":1727986218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15714-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157134","9783031157141"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15714-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","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":"Colchester","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2022","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","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":"34","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":"41% - 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.01","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":"6.9","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)"}}]}}