{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:01:43Z","timestamp":1743130903321,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"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_15","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"224-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Nonmanipulative Vote-Deficits of\u00a0Voting Rules"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7731-6818","authenticated-orcid":false,"given":"Yongjie","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., Gaspers, S., Mattei, N., Narodytska, N., Walsh, T.: Ties matter: complexity of manipulation when tie-breaking with a random vote. In: AAAI, pp. 74\u201380 (2013)","DOI":"10.1609\/aaai.v27i1.8701"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bachmeier, G., et al.: $$k$$-majority digraphs and the hardness of voting with a constant number of voters. J. Comput. Syst. Sci. 105, 130\u2013157 (2019)","DOI":"10.1016\/j.jcss.2019.04.005"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Bartholdi III, J.J., Orlin, J.B.: Single transferable vote resists strategic voting. Soc. Choice Welfare 8(4), 341\u2013354 (1991). https:\/\/doi.org\/10.1007\/BF00183045","DOI":"10.1007\/BF00183045"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Bartholdi III, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welfare 6(3), 227\u2013241 (1989). https:\/\/doi.org\/10.1007\/BF00295861","DOI":"10.1007\/BF00295861"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Bartholdi III, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16(8\u20139), 27\u201340 (1992)","DOI":"10.1016\/0895-7177(92)90085-Y"},{"key":"15_CR6","unstructured":"Betzler, N., Niedermeier, R., Woeginger, G.J.: Unweighted coalitional manipulation under the Borda rule is NP-hard. In: IJCAI, pp. 55\u201360 (2011)"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1086\/256633","volume":"56","author":"D Black","year":"1948","unstructured":"Black, D.: On the rationale of group decision-making. J. Polit. Econ. 56(1), 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"key":"15_CR8","unstructured":"Cary, D.: Estimating the margin of victory for instant-runoff voting. In: EVT\/WOTE (2011)"},{"key":"15_CR9","unstructured":"Elkind, E., Grandi, U., Rossi, F., Slinko, A.: Gibbard-Satterthwaite games. In: IJCAI, pp. 533\u2013539 (2015)"},{"key":"15_CR10","unstructured":"Erd\u0151s, P., Moser, L.: On the representation of directed graphs as unions of orderings. Math. Inst. Hung. Acad. Sci. 9, 125\u2013132 (1964)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, chap. 7, pp. 146\u2013168. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.008"},{"issue":"4","key":"15_CR12","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"},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"665","DOI":"10.2307\/1911681","volume":"45","author":"A Gibbard","year":"1977","unstructured":"Gibbard, A.: Manipulation of schemes that mix voting with chance. Econometrica 45(3), 665\u2013681 (1977)","journal-title":"Econometrica"},{"key":"15_CR14","unstructured":"Magrino, T.R., Rivest, R.L., Shen, E.: Computing the margin of victory in IRV elections. In: EVT\/WOTE (2011)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-41575-3_20","volume-title":"Algorithmic Decision Theory","author":"N Mattei","year":"2013","unstructured":"Mattei, N., Walsh, T.: PrefLib: a library for preferences http:\/\/www.preflib.org. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS (LNAI), vol. 8176, pp. 259\u2013270. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41575-3_20"},{"issue":"2\u20133","key":"15_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.cosrev.2012.03.001","volume":"6","author":"C Menton","year":"2012","unstructured":"Menton, C., Singh, P.: Manipulation can be hard in tractable voting systems even for constant-sized coalitions. Comput. Sci. Rev. 6(2\u20133), 71\u201387 (2012)","journal-title":"Comput. Sci. Rev."},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single peakedness. Public Choice 35(4), 437\u2013455 (1980)","journal-title":"Public Choice"},{"key":"15_CR18","unstructured":"Obraztsova, S., Elkind, E., Hazon, N.: Ties matter: complexity of voting manipulation revisited. In: AAMAS, pp. 71\u201378 (2011)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D.: Can approximation circumvent Gibbard-Satterthwaite? In: AAAI, pp. 836\u2013841 (2010)","DOI":"10.1609\/aaai.v24i1.7619"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"M Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.: Strategy-proofness and Arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theory 10(2), 187\u2013217 (1975)","journal-title":"J. Econ. Theory"},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Schulze, M.: A new monotonic, clone-independent, reversal symmetric, and Condorcet-consistent single-winner election method. Soc. Choice Welfare 36(2), 267\u2013303 (2011). https:\/\/doi.org\/10.1007\/s00355-010-0475-4","DOI":"10.1007\/s00355-010-0475-4"},{"key":"15_CR22","unstructured":"Smith, W.D.: Descriptions of single-winner voting systems (2006). http:\/\/m-schulze.9mail.de\/votedesc.pdf"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: EC, pp. 982\u2013999 (2012)","DOI":"10.1145\/2229012.2229086"},{"key":"15_CR24","unstructured":"Xia, L., Zuckerman, M., Procaccia, A.D., Conitzer, V., Rosenschein, J.S.: Complexity of unweighted coalitional manipulation under some common voting rules. In: IJCAI, pp. 348\u2013353 (2009)"},{"key":"15_CR25","unstructured":"Yang, Y.: Manipulation with bounded single-peaked width: a parameterized study. In: AAMAS, pp. 77\u201385 (2015)"},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2016.02.003","volume":"622","author":"Y Yang","year":"2016","unstructured":"Yang, Y., Guo, J.: Exact algorithms for weighted and unweighted Borda manipulation problems. Theor. Comput. Sci. 622, 79\u201389 (2016)","journal-title":"Theor. Comput. Sci."}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:45Z","timestamp":1673647305000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}