{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T04:26:59Z","timestamp":1729052819244},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031739026","type":"print"},{"value":"9783031739033","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-73903-3_3","type":"book-chapter","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:01:53Z","timestamp":1729026113000},"page":"33-47","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Approximately Strategy-Proof Tournament Rules for\u00a0Collusions of\u00a0Size at\u00a0Least Three"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-4223-4783","authenticated-orcid":false,"given":"David","family":"Mik\u0161an\u00edk","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4016-6235","authenticated-orcid":false,"given":"Ariel","family":"Schvartzman","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5039-3872","authenticated-orcid":false,"given":"Jan","family":"Soukup","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,16]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Altman, A., Kleinberg, R.: Nonmanipulable randomized tournament selections. In: Proceedings of the National Conference on Artificial Intelligence, vol. 2, pp. 686\u2013690 (2010)","DOI":"10.1609\/aaai.v24i1.7613"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16(8), 27\u201340 (1992). https:\/\/doi.org\/10.1016\/0895-7177(92)90085-Y. http:\/\/www.sciencedirect.com\/science\/article\/pii\/089571779290085Y","DOI":"10.1016\/0895-7177(92)90085-Y"},{"key":"3_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"key":"3_CR4","unstructured":"Copeland, A.: A \u2018reasonable\u2019 social welfare function. Seminar on Mathematics in Social Sciences (1951)"},{"key":"3_CR5","unstructured":"Csato, L.: 2018 FIFA World Cup qualification can be manipulated (2017)"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Dale, E., Fielding, J., Ramakrishnan, H., Sathyanarayanan, S., Weinberg, S.M.: Approximately strategyproof tournament rules with multiple prizes. In: Proceedings of the 23rd ACM Conference on Economics and Computation, EC 2022, pp. 1082\u20131100. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3490486.3538242","DOI":"10.1145\/3490486.3538242"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-031-22832-2_16","volume-title":"Web and Internet Economics","author":"A Dinev","year":"2022","unstructured":"Dinev, A., Weinberg, S.M.: Tight bounds on 3-team manipulations in randomized death match. In: Hansen, K.A., Liu, T.X., Malekian, A. (eds.) WINE 2022. LNCS, vol. 13778, pp. 273\u2013291. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22832-2_16"},{"key":"3_CR8","unstructured":"Ding, K., Weinberg, S.M.: Approximately strategyproof tournament rules in the probabilistic setting. In: 12th Innovations in Theoretical Computer Science Conference, LIPIcs. Leibniz International Proceedings in Informatics, vol.\u00a0185, p. 20. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2021). Art. No. 14"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Dutta, B.: Covering sets and a new Condorcet choice correspondence. J. Econ. Theory 44(1), 63\u201380 (1988). https:\/\/doi.org\/10.1016\/0022-0531(88)90096-8. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0022053188900968","DOI":"10.1016\/0022-0531(88)90096-8"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"PC Fishburn","year":"1977","unstructured":"Fishburn, P.C.: Condorcet social choice functions. SIAM J. Appl. Math. 33(3), 469\u2013489 (1977). https:\/\/doi.org\/10.1137\/0133030","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"key":"3_CR12","unstructured":"Kim, M.P., Suksompong, W., Vassilevska\u00a0Williams, V.: Who can win a single-elimination tournament? In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA, 12\u201317 February 2016, pp. 516\u2013522 (2016). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/12194"},{"key":"3_CR13","unstructured":"Kim, M.P., Vassilevska\u00a0Williams, V.: Fixing tournaments for kings, chokers, and more. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 561\u2013567 (2015). http:\/\/ijcai.org\/Abstract\/15\/085"},{"key":"3_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60805-6","volume-title":"Tournament Solutions and Majority Voting","author":"JF Laslier","year":"1997","unstructured":"Laslier, J.F.: Tournament Solutions and Majority Voting, vol. 7. Springer, Heidelberg (1997)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Maurer, S.B.: The king chicken theorems. Math. Mag. 53(2), 67\u201380 (1980). http:\/\/www.jstor.org\/stable\/2689952","DOI":"10.1080\/0025570X.1980.11976831"},{"key":"3_CR16","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":"3_CR17","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Choosing from a tournament. Soc. Choice Welf. 3(4), 271\u2013291 (1986). http:\/\/www.jstor.org\/stable\/41105842","DOI":"10.1007\/BF00292732"},{"key":"3_CR18","unstructured":"Schneider, J., Schvartzman, A., Weinberg, S.M.: Condorcet-consistent and approximately strategyproof tournament rules. In: 8th Innovations in Theoretical Computer Science Conference, LIPIcs. Leibniz International Proceedings in Informatics, vol.\u00a067, p. 20. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2017). Art. No. 35"},{"key":"3_CR19","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, LIPIcs. Leibniz International Proceedings in Informatics, vol.\u00a0151, p. 25. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2020). Art. No. 3"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Stanton, I., Vassilevska\u00a0Williams, V.: Rigging tournament brackets for weaker players. In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, 16\u201322 July 2011, pp. 357\u2013364 (2011). https:\/\/doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-069","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-069"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Suksompong, W.: Tournaments in computational social choice: recent developments. In: Zhou, Z.H. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-2021, pp. 4611\u20134618. International Joint Conferences on Artificial Intelligence Organization (2021). https:\/\/doi.org\/10.24963\/ijcai.2021\/626. Survey Track","DOI":"10.24963\/ijcai.2021\/626"},{"key":"3_CR22","unstructured":"Vassilevska\u00a0Williams, V.: Fixing a tournament. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, 11\u201315 July 2010 (2010). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI10\/paper\/view\/1726"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Vu, T., Altman, A., Shoham, Y.: On the complexity of schedule control problems for knockout tournaments. In: 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, 10\u201315 May 2009, vol. 1, pp. 225\u2013232 (2009). https:\/\/doi.org\/10.1145\/1558013.1558044","DOI":"10.1145\/1558013.1558044"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-73903-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:02:52Z","timestamp":1729026172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-73903-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9783031739026","9783031739033"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-73903-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,16]]},"assertion":[{"value":"16 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Brunswick, NJ","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/preflib.github.io\/adt2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}