{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:08:03Z","timestamp":1778494083614,"version":"3.51.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031228315","type":"print"},{"value":"9783031228322","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22832-2_16","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T09:05:33Z","timestamp":1670490333000},"page":"273-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Tight Bounds on\u00a03-Team Manipulations in\u00a0Randomized Death Match"],"prefix":"10.1007","author":[{"given":"Atanas","family":"Dinev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Matthew","family":"Weinberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Altman, A., Kleinberg, R.: Nonmanipulable randomized tournament selections. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 24 (2010)","DOI":"10.1609\/aaai.v24i1.7613"},{"key":"16_CR2","unstructured":"Altman, A., Procaccia, A.D., Tennenholtz, M.: Nonmanipulable selections from a tournament. In: Computational Foundations of Social Choice. Dagstuhl Seminar Proceedings, 07 March\u201312 March 2010, vol. 10101. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany (2010). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2010\/2560\/"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Banks, J.S.: Sophisticated voting outcomes and agenda control. Soc. Choice Welfare 1(4), 295\u2013306 (1985). https:\/\/doi.org\/10.1007\/BF00649265. http:\/\/www.jstor.org\/stable\/41105790","DOI":"10.1007\/BF00649265"},{"issue":"5","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.3982\/ECTA13337","volume":"84","author":"F Brandl","year":"2016","unstructured":"Brandl, F., Brandt, F., Seedig, H.G.: Consistent probabilistic social choice. Econometrica 84(5), 1839\u20131880 (2016)","journal-title":"Econometrica"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Dinev, A., Weinberg, S.M.: Tight bounds on 3-team manipulations in randomized death match. In: Hansen, K.A., et al. (eds.) WINE 2022. LNCS, vol. 13778, pp. 273\u2013291. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22832-2_16"},{"key":"16_CR6","unstructured":"Ding, K., Weinberg, S.M.: Approximately strategyproof tournament rules in the probabilistic setting. In: 12th Innovations in Theoretical Computer Science Conference, ITCS (2021)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Clone structures in voters\u2019 preferences. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 496\u2013513 (2012)","DOI":"10.1145\/2229012.2229050"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Fishburn, P.C.: Condorcet social choice functions. SIAM J. Appl. Math. 33(3), 469\u2013489 (1977). http:\/\/www.jstor.org\/stable\/2100704","DOI":"10.1137\/0133030"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Fisher, D.C., Ryan, J.: Optimal strategies for a generalized \u201cscissors, paper, and stone\u201d game. Am. Math. Monthly 99(10), 935\u2013942 (1992). http:\/\/www.jstor.org\/stable\/2324486","DOI":"10.1080\/00029890.1992.11995957"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Laffond, G., Laslier, J.F., Le Breton, M.: The bipartisan set of a tournament game. Games Econ. Behav. 5(1), 182\u2013201 (1993). https:\/\/EconPapers.repec.org\/RePEc:eee:gamebe:v:5:y:1993:i:1:p:182-201","DOI":"10.1006\/game.1993.1010"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1137\/16M1061783","volume":"31","author":"MP Kim","year":"2017","unstructured":"Kim, M.P., Suksompong, W., Williams, V.V.: Who can win a single-elimination tournament? SIAM J. Discrete Math. 31(3), 1751\u20131764 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR12","unstructured":"Kim, M.P., Williams, V.V.: Fixing tournaments for kings, chokers, and more. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00179100","volume":"13","author":"G Laffond","year":"1996","unstructured":"Laffond, G., Lain\u00e9, J., Laslier, J.F.: Composition-consistent tournament solutions and social choice functions. Soc. Choice Welfare 13(1), 75\u201393 (1996). https:\/\/doi.org\/10.1007\/BF00179100","journal-title":"Soc. Choice Welfare"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Miller, N.R.: A new solution set for tournaments and majority voting: further graph-theoretical approaches to the theory of voting. Am. J. Polit. Sci. 24(1), 68\u201396 (1980). http:\/\/www.jstor.org\/stable\/2110925","DOI":"10.2307\/2110925"},{"key":"16_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"H Moulin","year":"2016","unstructured":"Moulin, H.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016). https:\/\/doi.org\/10.1017\/CBO9781107446984"},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s00182-020-00711-7","volume":"49","author":"ZE \u00d6zt\u00fcrk","year":"2020","unstructured":"\u00d6zt\u00fcrk, Z.E.: Consistency of scoring rules: a reinvestigation of composition-consistency. Int. J. Game Theory 49(3), 801\u2013831 (2020). https:\/\/doi.org\/10.1007\/s00182-020-00711-7","journal-title":"Int. J. Game Theory"},{"key":"16_CR17","unstructured":"Schneider, J., Schvartzman, A., Weinberg, S.M.: Condorcet-consistent and approximately strategyproof tournament rules. In: Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS) (2017)"},{"key":"16_CR18","unstructured":"Schvartzman, A., Weinberg, S.M., Zlatin, E., Zuo, A.: Approximately strategyproof tournament rules: on large manipulating sets and cover-consistence. In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, 12\u201314 January 2020"},{"key":"16_CR19","unstructured":"Stanton, I., Williams, V.V.: Rigging tournament brackets for weaker players. In: IJCAI Proceedings-International Joint Conference on Artificial Intelligence, vol. 22, p. 357 (2011)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22832-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:48:17Z","timestamp":1710269297000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22832-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228315","9783031228322"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22832-2_16","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":"9 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Troy, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.rpi.edu\/wine2022\/","order":11,"name":"conference_url","label":"Conference URL","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":"126","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":"19","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":"15% - 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":"6","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)"}},{"value":"19 abstracts in the back matter","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}