{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:09:19Z","timestamp":1743016159135,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_5","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"64-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Isomorphic Distances Among Elections"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Faliszewski","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Skowron","sequence":"additional","affiliation":[]},{"given":"Arkadii","family":"Slinko","sequence":"additional","affiliation":[]},{"given":"Stanis\u0142aw","family":"Szufa","sequence":"additional","affiliation":[]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-32589-2_12","volume-title":"Mathematical Foundations of Computer Science 2012","author":"V Arvind","year":"2012","unstructured":"Arvind, V., K\u00f6bler, J., Kuhnert, S., Vasudev, Y.: Approximate graph isomorphism. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 100\u2013111. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_12"},{"issue":"12","key":"5_CR2","first-page":"1","volume":"5","author":"L Babai","year":"2015","unstructured":"Babai, L., Dawar, A., Schweitzer, P., Tor\u00e1n, J.: The graph isomorphism problem (Dagstuhl seminar 15511). Dagstuhl Rep. 5(12), 1\u201317 (2015)","journal-title":"Dagstuhl Rep."},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welfare 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welfare"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welfare 6(2), 157\u2013165 (1989)","journal-title":"Soc. Choice Welfare"},{"issue":"8\/9","key":"5_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J Bartholdi III","year":"1992","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: How hard is it to control an election? Math. Comput. Modeling 16(8\/9), 27\u201340 (1992)","journal-title":"Math. Comput. Modeling"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.): Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"5_CR7","unstructured":"Brandt, F., Geist, C., Strobel, M.: Analyzing the practical relevance of voting paradoxes via Ehrhart theory, computer simulations, and empirical data. In: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2016), pp. 385\u2013393 (2016)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-319-66700-3_7","volume-title":"Algorithmic Game Theory","author":"R Bredereck","year":"2017","unstructured":"Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Niedermeier, R., Skowron, P., Talmon, N.: Robustness among multiwinner voting rules. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 80\u201392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_7"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM 54(3), Article\u00a014 (2007)","DOI":"10.1145\/1236457.1236461"},{"key":"5_CR10","unstructured":"Diaconis, P., Graham, R.: Spearman\u2019s footrule as a measure of disarray. J. Roy. Stat. Soc. Ser. B 39(2), 262\u2013268 (1977)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International World Wide Web Conference (WWW-2001), pp. 613\u2013622. ACM Press, March 2001","DOI":"10.1145\/371920.372165"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-04645-2_27","volume-title":"Algorithmic Game Theory","author":"E Elkind","year":"2009","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 299\u2013310. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04645-2_27"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s00355-015-0892-5","volume":"45","author":"E Elkind","year":"2015","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Distance rationalization of voting rules. Soc. Choice Welfare 45(2), 345\u2013377 (2015). https:\/\/doi.org\/10.1007\/s00355-015-0892-5","journal-title":"Soc. Choice Welfare"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Elkind, E., Gan, J., Obraztsova, S., Rabinovich, Z., Voudouris, A.: Protecting elections by recounting ballots. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI-2019), pp. 259\u2013265 (2019)","DOI":"10.24963\/ijcai.2019\/37"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.jcss.2014.11.002","volume":"81","author":"G Erd\u00e9lyi","year":"2015","unstructured":"Erd\u00e9lyi, G., Fellows, M., Rothe, J., Schend, L.: Control complexity in Bucklin and fallback voting: a theoretical analysis. J. Comput. Syst. Sci. 81(4), 632\u2013660 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.jcss.2014.11.003","volume":"81","author":"G Erd\u00e9lyi","year":"2015","unstructured":"Erd\u00e9lyi, G., Fellows, M., Rothe, J., Schend, L.: Control complexity in Bucklin and fallback voting: an experimental analysis. J. Comput. Syst. Sci. 81(4), 661\u2013670 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/0022250X.2011.597012","volume":"37","author":"\u00d6 E\u011fecio\u011flu","year":"2013","unstructured":"E\u011fecio\u011flu, \u00d6., Giritligil, A.: The impartial, anonymous, and neutral culture model: a probability model for sampling public preference structures. J. Math. Sociol. 37(4), 203\u2013222 (2013)","journal-title":"J. Math. Sociol."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Szufa, S., Talmon, N.: How similar are two elections? In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI-2019), pp. 1909\u20131916 (2019)","DOI":"10.1609\/aaai.v33i01.33011909"},{"issue":"5","key":"5_CR20","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10732-018-9376-y","volume":"24","author":"P Faliszewski","year":"2018","unstructured":"Faliszewski, P., Slinko, A., Stahl, K., Talmon, N.: Achieving fully proportional representation by clustering voters. J. Heurist. 24(5), 725\u2013756 (2018). https:\/\/doi.org\/10.1007\/s10732-018-9376-y","journal-title":"J. Heurist."},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"P Fishburn","year":"1977","unstructured":"Fishburn, P.: Condorcet social choice functions. SIAM J. Appl. Math. 33(3), 469\u2013489 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Goldsmith, J., Lang, J., Mattei, N., Perny, P.: Voting with rank dependent scoring rules. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI-2014), pp. 698\u2013704 (2014)","DOI":"10.1609\/aaai.v28i1.8826"},{"key":"5_CR23","unstructured":"Grohe, M., Rattan, G., Woeginger, G.: Graph similarity and approximate isomorphism. In: Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS-2018), pp. 20:1\u201320:16 (2018)"},{"issue":"6","key":"5_CR24","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1145\/268999.269002","volume":"44","author":"E Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Exact analysis of Dodgson elections: Lewis Carroll\u2019s 1876 voting system is complete for parallel access to NP. J. ACM 44(6), 806\u2013825 (1997)","journal-title":"J. ACM"},{"issue":"5\u20136","key":"5_CR25","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Anyone but him: the complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"issue":"3","key":"5_CR26","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theoret. Comput. Sci. 349(3), 382\u2013391 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1613\/jair.1.11335","volume":"64","author":"O Keller","year":"2019","unstructured":"Keller, O., Hassidim, A., Hazon, N.: New approximations for coalitional manipulation in scoring rules. J. Artif. Intell. Res. 64, 109\u2013145 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR28","unstructured":"Konicki, C., Vassilevska Williams, V.: Bribery in balanced knockout tournaments. In: Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2019), pp. 2066\u20132068 (2019)"},{"key":"5_CR29","unstructured":"Mattei, N., Forshee, J., Goldsmith, J.: An empirical study of voting rules and manipulation with large datasets. In: Proceedings of the 4th International Workshop on Computational Social Choice (COMSOC-2012) (2012)"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Mattei, N., Walsh, T.: Preflib: a library for preferences. In: Proceedings of the 3nd International Conference on Algorithmic Decision Theory (ADT-2013), pp. 259\u2013270 (2013)","DOI":"10.1007\/978-3-642-41575-3_20"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Meskanen, T., Nurmi, H.: Closeness counts in social choice. In: Braham, M., Steffen, F. (eds.) Power, Freedom, and Voting. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-73382-9_15","DOI":"10.1007\/978-3-540-73382-9_15"},{"issue":"2","key":"5_CR32","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF00134214","volume":"13","author":"S Nitzan","year":"1981","unstructured":"Nitzan, S.: Some measures of closeness to unanimity and their implications. Theory Decis. 13(2), 129\u2013138 (1981)","journal-title":"Theory Decis."},{"issue":"3","key":"5_CR33","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","volume":"30","author":"A Procaccia","year":"2008","unstructured":"Procaccia, A., Rosenschein, J., Zohar, A.: On the complexity of achieving proportional representation. Soc. Choice Welfare 30(3), 353\u2013362 (2008)","journal-title":"Soc. Choice Welfare"},{"key":"5_CR34","unstructured":"Redko, I., Vayer, T., Flamary, R., Courty, N.: Co-optimal transport. Technical report arXiv:2002.03731 [stat.ML], February 2020"},{"key":"5_CR35","unstructured":"Shiryaev, D., Yu, L., Elkind, E.: On elections with robust winners. In: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2013), pp. 415\u2013422 (2013)"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.artint.2015.01.003","volume":"222","author":"P Skowron","year":"2015","unstructured":"Skowron, P., Faliszewski, P., Slinko, A.: Achieving fully proportional representation: approximability result. Artif. Intell. 222, 67\u2013103 (2015)","journal-title":"Artif. Intell."},{"key":"5_CR37","unstructured":"Szufa, S., Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Drawing a map of elections in the space of statistical cultures. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2020) (2020, to appear)"},{"key":"5_CR38","doi-asserted-by":"publisher","unstructured":"Tideman, T., Plassmann, F.: Modeling the outcomes of vote-casting in actual elections. In: Felsenthal, D., Machover, M. (eds.) Electoral Systems: Paradoxes, Assumptions, and Procedures, pp. 217\u2013251. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-20441-8_9","DOI":"10.1007\/978-3-642-20441-8_9"},{"issue":"1","key":"5_CR39","first-page":"1","volume":"42","author":"T Walsh","year":"2011","unstructured":"Walsh, T.: Where are the hard manipulation problems. J. Artif. Intell. Res. 42(1), 1\u201329 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Wang, J., Sikdar, S., Shepherd, T., Zhao, Z., Jiang, C., Xia, L.: Practical algorithms for multi-stage voting rules with parallel universes tiebreaking. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI-2019), pp. 2189\u20132196 (2019)","DOI":"10.1609\/aaai.v33i01.33012189"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC-2012), pp. 982\u2013999. ACM Press, June 2012","DOI":"10.1145\/2229012.2229086"},{"key":"5_CR42","unstructured":"Yin, Y., Vorobeychik, Y., An, B., Hazon, N.: Optimally protecting elections. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI-2016), pp. 538\u2013545 (2016)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T17:58:18Z","timestamp":1667066298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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":"49","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":"25","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":"51% - 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)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","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)"}}]}}