{"type":"ScholarlyArticle","title":"Understanding Distance Measures Among Elections","authors":[{"name":"Niclas Boehmer","slug":"niclas-boehmer","given":"Niclas","family":"Boehmer","affiliation":"Technische Universität Berlin , Algorithmics and Computational Complexity"},{"name":"Piotr Faliszewski","slug":"piotr-faliszewski","given":"Piotr","family":"Faliszewski","affiliation":"AGH University"},{"name":"Rolf Niedermeier","slug":"rolf-niedermeier","given":"Rolf","family":"Niedermeier","affiliation":"Technische Universität Berlin , Algorithmics and Computational Complexity"},{"name":"Stanisław Szufa","slug":"stanis-aw-szufa","given":"Stanisław","family":"Szufa","affiliation":"AGH University"},{"name":"Tomasz Wąs","slug":"tomasz-was","given":"Tomasz","family":"Wąs","affiliation":"AGH University; University of Warsaw"}],"abstract":"Motivated by putting empirical work based on (synthetic) election data on a more solid mathematical basis, we analyze six distances among elections, including, e.g., the challenging-to-compute but very precise swap distance and the distance used to form the so-called map of elections. Among the six, the latter seems to strike the best balance between its computational complexity and expressiveness.","doi":"10.24963/ijcai.2022/15","url":"https://ijcai.org/proceedings/2022/15","pdf":"https://ijcai.org/proceedings/2022/0015.pdf","markdown":"https://ijcai.org/proceedings/2022/15.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/15","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Agent-based and Multi-agent Systems","track":"Main Track","number":15,"pages":{"first":102,"last":108},"keywords":["Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986768","length_sec":91,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984911","length_sec":366,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Bachmeier et al., 2019] Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Do- minik Peters, and Hans Georg Seedig. k-majority digraphs and the hardness of voting with a constant number of vot- ers. Journal of Computer and System Sciences, 105:130- 157, 2019.","title":"k-majority digraphs and the hardness of voting with a constant number of voters","authors":"Bachmeier","year":"2019","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bartholdi et al., 1989] John Bartholdi, III, Craig Tovey, and Michael Trick. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6(2):157-165, 1989.","title":"Voting schemes for which it can be difficult to tell who won the election","authors":"Bartholdi","year":"1989","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Betzler et al., 2011] Nadja Betzler, Rolf Niedermeier, and Gerhard J. Woeginger. Unweighted coalitional manipula- tion under the Borda rule is NP-hard. In Proceedings of IJCAI-2011, pages 55-60, 2011.","title":"Unweighted coalitional manipulation under the Borda rule is NP-hard","authors":"Nadja Betzler, Rolf Niedermeier, Gerhard J Woeginger","year":"2011","venue":"Proceedings of IJCAI-2011","doi":null,"url":null,"internal_url":"/proceedings/2011/21"},{"position":4,"raw":"[Boehmer and Schaar, 2022] Niclas Boehmer and Nathan Schaar. Collecting, classifying, analyzing, and using real-world elections. Technical Report arXiv:2204.03589 [cs.GT], arXiv.org, 2022.","title":"Collecting, classifying, analyzing, and using real-world elections","authors":"Schaar Boehmer, Niclas Boehmer, Nathan Schaar","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Boehmer et al., 2021a] Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, and Rolf Niedermeier. Winner robust- ness via swap-and shift-bribery: Parameterized counting complexity and experiments. In Proceedings of IJCAI- 2021, pages 52-58, 2021.","title":"Winner robustness via swap-and shift-bribery: Parameterized counting complexity and experiments","authors":"Boehmer","year":"2021","venue":"Proceedings of IJCAI-2021","doi":null,"url":null,"internal_url":"/proceedings/2021/8"},{"position":6,"raw":"[Boehmer et al., 2021b] Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, and Stanislaw Szufa. Putting a compass on the map of elections. In Proceedings of IJCAI-2021, pages 59-65, 2021.","title":"Putting a compass on the map of elections","authors":"Boehmer","year":"2021","venue":"Proceedings of IJCAI-2021","doi":null,"url":null,"internal_url":"/proceedings/2021/9"},{"position":7,"raw":"[Boehmer et al., 2022] Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, and Tomasz W ąs. Un- derstanding distance measures among elections. Technical Report arXiv:2205.00492 [cs.GT], arXiv.org, 2022.","title":"Understanding distance measures among elections","authors":"Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz W Ąs","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Conitzer, 2009] Vincent Conitzer. Eliciting single-peaked preferences using comparison queries. Journal of Artificial Intelligence Research, 35:161-191, 2009.","title":"Eliciting single-peaked preferences using comparison queries","authors":"Vincent Conitzer, Conitzer","year":"2009","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dwork et al., 2001] Cynthia Dwork, Ravi Kumar, Moni Naor, and D. Sivakumar. Rank aggregation methods for the web. In Proceedings of WWW-2001, pages 613-622, March 2001.","title":"Rank aggregation methods for the web","authors":"Cynthia Dwork, Ravi Kumar, Moni Naor, D Sivakumar","year":"2001","venue":"Proceedings of WWW-2001","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Egecioglu and Giritligil, 2013] Ömer Egecioglu and Ayca Giritligil. The impartial, anonymous, and neutral cul- ture model: A probability model for sampling public pref- erence structures. Journal of Mathematical Sociology, 37(4):203-222, 2013.","title":"Ömer Egecioglu and Ayca Giritligil. The impartial, anonymous, and neutral culture model: A probability model for sampling public pref-erence structures","authors":"Giritligil Egecioglu","year":"2013","venue":"Journal of Mathematical Sociology","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Faliszewski et al., 2019] Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, and Nimrod Talmon. How similar are two elections? In Proceedings of AAAI- 2019, pages 1909-1916, 2019.","title":"How similar are two elections?","authors":"Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon","year":"2019","venue":"Proceedings of AAAI-2019","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Faliszewski et al., 2022] Piotr Faliszewski, Alexander Kar- pov, and Svetlana Obraztsova. The complexity of election problems with group-separable preferences. Autonomous Agents and Multi-Agent Systems, 36(1):18, 2022.","title":"The complexity of election problems with group-separable preferences","authors":"Piotr Faliszewski, Alexander Karpov, Svetlana Obraztsova","year":"2022","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":"/proceedings/2020/29"},{"position":13,"raw":"[Fruchterman and Reingold, 1991] Thomas Fruchterman and Edward Reingold. Graph drawing by force- directed placement. Software: Practice and Experience, 21(11):1129-1164, 1991.","title":"Graph drawing by forcedirected placement","authors":"Fruchterman, Reingold ;, Edward Reingold","year":"1991","venue":"Software: Practice and Experience","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gonzalez, 1985] Teofilo Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985.","title":"Clustering to minimize the maximum intercluster distance","authors":"Teofilo Gonzalez","year":"1985","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Grohe et al., 2018] Martin Grohe, Gaurav Rattan, and Ger- hard J. Woeginger. Graph similarity and approximate iso- morphism. In Proceedings of MFCS-2018, pages 20:1- 20:16, 2018.","title":"Graph similarity and approximate isomorphism","authors":"Martin Grohe, Gaurav Rattan, Gerhard J Woeginger","year":"2018","venue":"Proceedings of MFCS-2018","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Inada, 1964] Ken-ichi Inada. A note on the simple majority decision rule. Econometrica, 32(32):525-531, 1964.","title":"A note on the simple majority decision rule","authors":"Ken-Ichi Inada","year":"1964","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Inada, 1969] Ken-ichi Inada. The simple majority decision rule. Econometrica, 37(3):490-506, 1969.","title":"The simple majority decision rule","authors":"Ken-Ichi Inada","year":"1969","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Karpov, 2019] Alexander Karpov. On the number of group- separable preference profiles. Group Decision and Nego- tiation, 28(3):501-517, 2019.","title":"On the number of groupseparable preference profiles","authors":"Alexander Karpov","year":"2019","venue":"Group Decision and Negotiation","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Khamsi and Kirk, 2001] Mohamed Khamsi and William Kirk. An Introduction to Metric Spaces and Fixed Point Theory. Wiley, 2001.","title":"An Introduction to Metric Spaces and Fixed Point Theory","authors":"Kirk ; Khamsi, Mohamed Khamsi, William Kirk","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Mattei and Walsh, 2013] Nicholas Mattei and Toby Walsh. Preflib: A library for preferences. In Proceedings of ADT- 2013, pages 259-270, 2013.","title":"Preflib: A library for preferences","authors":"Walsh ; Mattei, Nicholas Mattei, Toby Walsh","year":"2013","venue":"Proceedings of ADT-2013","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[McGarvey, 1953] David McGarvey. A theorem on the con- struction of voting paradoxes. Econometrica, 21(4):608- 610, 1953.","title":"A theorem on the construction of voting paradoxes","authors":"David Mcgarvey","year":"1953","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Peters and Lackner, 2020] Dominik Peters and Martin Lackner. Preferences single-peaked on a circle. Journal of Artificial Intelligence Research, 68:463-502, 2020.","title":"Preferences single-peaked on a circle","authors":"Lackner Peters, Dominik Peters, Martin Lackner","year":"2020","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Rubner et al., 2000] Yossi Rubner, Carlo Tomasi, and Leonidas J. Guibas. The earth mover's distance as a met- ric for image retrieval. International Journal of Computer Vision, 40(2):99-121, 2000.","title":"The earth mover's distance as a metric for image retrieval","authors":"Yossi Rubner, Carlo Tomasi, Leonidas J Guibas","year":"2000","venue":"International Journal of Computer Vision","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Szufa et al., 2020] Stanislaw Szufa, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, and Nimrod Talmon. Drawing a map of elections in the space of statistical cultures. In Proceedings of AAMAS-2020, pages 1341-1349, 2020.","title":"Drawing a map of elections in the space of statistical cultures","authors":"Stanislaw Szufa, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon","year":"2020","venue":"Proceedings of AAMAS-2020","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Walsh, 2015] Toby Walsh. Generating single peaked votes. Technical Report arXiv:1503.02766 [cs.GT], arXiv.org, March 2015.","title":"Generating single peaked votes","authors":"Toby Walsh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}