{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:43:02Z","timestamp":1777131782079,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030877552","type":"print"},{"value":"9783030877569","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_12","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"179-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Obvious Manipulability of Voting Rules"],"prefix":"10.1007","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1086\/256963","volume":"58","author":"K Arrow","year":"1950","unstructured":"Arrow, K.: A difficulty in the concept of social welfare. J. Polit. Econ. 58, 328\u2013346 (1950)","journal-title":"J. Polit. Econ."},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Black, D.: Borda, condorcet and laplace. In: The Theory of Committees and Elections, chap. 18, pp. 156\u2013162. Springer, Dordrecht (1986). https:\/\/doi.org\/10.1007\/978-94-009-4225-7_18","DOI":"10.1007\/978-94-009-4225-7_18"},{"key":"12_CR3","unstructured":"Carroll, G.: A quantitative approach to incentives : application to voting rules (2011)"},{"key":"12_CR4","unstructured":"Chisholm, H.: Vote and voting. In: Encyclopaedia Britannica, p. 216 (1911)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Walsh, T.: Barriers to manipulation in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, chap. 6. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.007"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Walsh, T., Xia, L.: Dominating manipulations in voting with partial information. In: Proceedings of the 25th AAAI Conference (2011)","DOI":"10.1609\/aaai.v25i1.7879"},{"key":"12_CR7","first-page":"53","volume":"31","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Procaccia, A.D.: AI\u2019s war on manipulation: are we winning? AI Mag. 31, 53\u201364 (2010)","journal-title":"AI Mag."},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Favardin, P., Lepelley, D., Serais, J.: Borda rule, copeland method and strategic manipulation. Rev. Econ. Des. 7(2), 213\u2013228 (2002). https:\/\/doi.org\/10.1007\/s100580200073","DOI":"10.1007\/s100580200073"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1080\/10361146.2014.900530","volume":"49","author":"J Fraenkel","year":"2014","unstructured":"Fraenkel, J., Grofman, B.: The Borda count and its real-world alternatives: comparing scoring rules in Nauru and Slovenia. Aust. J. Polit. Sci. 49(2), 186\u2013205 (2014)","journal-title":"Aust. J. Polit. Sci."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41(4), 587\u2013601 (1973)","DOI":"10.2307\/1914083"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"3257","DOI":"10.1257\/aer.20160425","volume":"107","author":"S Li","year":"2017","unstructured":"Li, S.: Obviously strategy-proof mechanisms. Am. Econ. Rev. 107, 3257\u20133287 (2017)","journal-title":"Am. Econ. Rev."},{"key":"12_CR12","first-page":"1","volume":"13","author":"R Meir","year":"2018","unstructured":"Meir, R.: Strategic voting. Synth. Lect. Artif. Intell. Mach. Learn. 13, 1\u2013167 (2018)","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1177\/0951692801013002004","volume":"13","author":"E Niou","year":"2001","unstructured":"Niou, E.: Strategic voting under plurality and runoff rules. J. Theor. Polit. 13(2), 209\u2013227 (2001)","journal-title":"J. Theor. Polit."},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Nitzan, S.: The vulnerability of point-voting schemes to preference variation and strategic manipulation. Public Choice 47, 349\u2013370 (1985). https:\/\/doi.org\/10.1007\/BF00127531","DOI":"10.1007\/BF00127531"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Ortega, J.: Obvious manipulations in cake-cutting. CoRR abs\/1908.02988 (2019)","DOI":"10.2139\/ssrn.3504487"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Peleg, B.: A note on manipulability of large voting schemes. Theor. Decis. 11(4), 401\u2013412 (1979). https:\/\/doi.org\/10.1007\/BF00139450","DOI":"10.1007\/BF00139450"},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1177\/0192512102023004002","volume":"23","author":"B Reilly","year":"2002","unstructured":"Reilly, B.: Social choice in the south seas: electoral innovation and the Borda count in the Pacific Island countries. Int. Polit. Sci. Rev. 23(4), 355\u2013372 (2002)","journal-title":"Int. Polit. Sci. Rev."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"MA Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.A.: Strategy-proofness and arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theor. 10, 187\u2013217 (1975)","journal-title":"J. Econ. Theor."},{"key":"12_CR19","unstructured":"Slinko, A., White, S.: Non-dictatorial social choice rules are safely manipulable. In: COMSOC 2008, pp. 403\u2013413 (2008)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00355-013-0785-4","volume":"43","author":"A Slinko","year":"2014","unstructured":"Slinko, A., White, S.: Is it ever safe to vote strategically? Soc. Choice Welfare 43, 403\u2013427 (2014)","journal-title":"Soc. Choice Welfare"},{"key":"12_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511614316","volume-title":"Social Choice and the Mathematics of Manipulation","author":"AD Taylor","year":"2005","unstructured":"Taylor, A.D.: Social Choice and the Mathematics of Manipulation. Cambridge University Press, Cambridge (2005)"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1257\/jep.9.1.27","volume":"9","author":"N Tideman","year":"1995","unstructured":"Tideman, N.: The single transferable vote. J. Econ. Perspect. 9(1), 27\u201338 (1995)","journal-title":"J. Econ. Perspect."},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"104970","DOI":"10.1016\/j.jet.2019.104970","volume":"185","author":"P Troyan","year":"2020","unstructured":"Troyan, P., Morrill, T.: Obvious manipulations. J. Econ. Theor. 185, 104970 (2020)","journal-title":"J. Econ. Theor."},{"key":"12_CR24","unstructured":"Wilson, M.C., Reyhani, R.: The probability of safe manipulation. In: COMSOC 2010 (2010)"},{"key":"12_CR25","unstructured":"Xia, L., Zuckerman, M., Procaccia, A.D., Conitzer, V., Rosenschein, J.S.: Complexity of unweighted coalitional manipulation under some common voting rules. In: Proceedings of the 21st IJCAI, pp. 348\u2013353 (2009)"},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.artint.2008.11.005","volume":"173","author":"M Zuckerman","year":"2009","unstructured":"Zuckerman, M., Procaccia, A.D., Rosenschein, J.S.: Algorithms for the coalitional manipulation problem. Artif. Intell. 173(2), 392\u2013412 (2009)","journal-title":"Artif. Intell."}],"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-030-87756-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:53Z","timestamp":1673647313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","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":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"58","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":"27","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":"47% - 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":"7","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)"}}]}}