{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T04:26:36Z","timestamp":1729052796567},"publisher-location":"Cham","reference-count":12,"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_12","type":"book-chapter","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:01:53Z","timestamp":1729026113000},"page":"174-188","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Toward Fair and\u00a0Strategyproof Tournament Rules for\u00a0Tournaments with\u00a0Partially Transferable Utilities"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-0522-4815","authenticated-orcid":false,"given":"David","family":"Pennock","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\/0009-0001-3977-8173","authenticated-orcid":false,"given":"Eric","family":"Xue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,16]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Altman, A., Kleinberg, R.: Nonmanipulable randomized tournament selections. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, pp. 686\u2013690. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7613"},{"key":"12_CR2","unstructured":"Altman, A., Procaccia, A.D., Tennenholtz, M.: Nonmanipulable selections from a tournament. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, pp. 27\u201332 (2009)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-540-77105-0_30","volume-title":"Internet and Network Economics","author":"F Brandt","year":"2007","unstructured":"Brandt, F., Fischer, F.: PageRank as a weak tournament solution. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 300\u2013305. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_30"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Dale, E., Fielding, J., Ramakrishnan, H., Sathyanarayanan, S., Weinberg, S.M.: Approximately strategyproof tournament rules with multiple prizes. In: The 23rd ACM Conference on Economics and Computation, EC 2022, Boulder, CO, USA, 11\u201315 July 2022, pp. 1082\u20131100. ACM (2022)","DOI":"10.1145\/3490486.3538242"},{"key":"12_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-031-22832-2_16","volume-title":"WINE 2022","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":"12_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) (2021)"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1002\/bs.3830370403","volume":"37","author":"DS Felsenthal","year":"1992","unstructured":"Felsenthal, D.S., Machover, M.: After two centuries, should condorcet\u2019s voting procedure be implemented? Behav. Sci. 37(4), 250\u2013274 (1992)","journal-title":"Behav. Sci."},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/130906726","volume":"28","author":"J Iglesias","year":"2014","unstructured":"Iglesias, J., Ince, N., Loh, P.S.: Computing with voting trees. SIAM J. Discret. Math. 28(2), 673\u2013684 (2014). https:\/\/doi.org\/10.1137\/130906726","journal-title":"SIAM J. Discret. Math."},{"key":"12_CR9","unstructured":"Mik\u0161an\u00edk, D., Schvartzman, A., Soukup, J.: On approximately strategy-proof tournament rules for collusions of size at least three (2024). https:\/\/arxiv.org\/abs\/2407.17569"},{"key":"12_CR10","unstructured":"Schneider, J., Schvartzman, A., Weinberg, S.M.: Condorcet-consistent and approximately strategyproof tournament rules. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) (2017)"},{"key":"12_CR11","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) (2020)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Suksompong, W.: Tournaments in computational social choice: recent developments. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, pp. 4611\u20134618. International Joint Conferences on Artificial Intelligence Organization (2021)","DOI":"10.24963\/ijcai.2021\/626"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:04:19Z","timestamp":1729026259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-73903-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9783031739026","9783031739033"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-73903-3_12","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":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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"}}]}}