{"type":"ScholarlyArticle","title":"Diversity, Agreement, and Polarization in Elections","authors":[{"name":"Piotr Faliszewski","slug":"piotr-faliszewski","given":"Piotr","family":"Faliszewski","affiliation":"AGH University , Poland"},{"name":"Andrzej Kaczmarczyk","slug":"andrzej-kaczmarczyk","given":"Andrzej","family":"Kaczmarczyk","affiliation":"AGH University , Poland"},{"name":"Krzysztof Sornat","slug":"krzysztof-sornat","given":"Krzysztof","family":"Sornat","affiliation":"IDSIA , USI-SUPSI , Switzerland"},{"name":"Stanisław Szufa","slug":"stanis-aw-szufa","given":"Stanisław","family":"Szufa","affiliation":"AGH University , Poland"},{"name":"Tomasz Wąs","slug":"tomasz-was","given":"Tomasz","family":"Wąs","affiliation":"Pennsylvania State University , PA , USA"}],"abstract":"We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such measures for the other two notions are lacking. We attempt to rectify this issue by designing appropriate measures, providing means of their (approximate) computation, and arguing that they, indeed, capture diversity and polarization well. In particular, we present \"maps of preference orders\" that highlight relations between the votes in a given election and which help in making arguments about their nature.","doi":"10.24963/ijcai.2023/299","url":"https://ijcai.org/proceedings/2023/299","pdf":"https://ijcai.org/proceedings/2023/0299.pdf","markdown":"https://ijcai.org/proceedings/2023/299.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/299","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Game Theory and Economic Paradigms","track":"Main Track","number":299,"pages":{"first":2684,"last":2692},"keywords":["Game Theory and Economic Paradigms: GTEP: Computational social choice"],"videos":[],"references":[{"position":1,"raw":"[Alcalde-Unzu and Vorsatz, 2013] J. Alcalde-Unzu and M. Vorsatz. Measuring the cohesiveness of preferences: An axiomatic analysis. Social Choice and Welfare, 41(4):965-988, 2013.","title":"Measuring the cohesiveness of preferences: An axiomatic analysis","authors":"J Alcalde-Unzu, M Vorsatz","year":"2013","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alcalde-Unzu and Vorsatz, 2016] J. Alcalde-Unzu and M. Vorsatz. Do we agree? Measuring the cohesiveness of preferences. Theory and Decision, 80(2):313-339, 2016.","title":"Do we agree? Measuring the cohesiveness of preferences","authors":"J Alcalde-Unzu, M Vorsatz","year":"2016","venue":"Theory and Decision","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alcantud et al., 2013] J. C. R. Alcantud, R. de An- drés Calle, and J. M. Cascón. A unifying model to measure consensus solutions in a society. Mathematical and Com- puter Modelling, 57(7-8):1876-1883, 2013.","title":"A unifying model to measure consensus solutions in a society","authors":"J C R Alcantud, R De Andrés Calle, J M Cascón","year":"2013","venue":"Mathematical and Computer Modelling","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Arrighi et al., 2021] E. Arrighi, H. Fernau, D. Lokshtanov, M. de Oliveira Oliveira, and P. Wolf. Diversity in Kemeny rank aggregation: A parameterized approach. In Proceed- ings of IJCAI-2021, pages 10-16, 2021.","title":"Diversity in Kemeny rank aggregation: A parameterized approach","authors":"E Arrighi, H Fernau, D Lokshtanov, M De Oliveira, P Oliveira, Wolf","year":"2021","venue":"Proceedings of IJCAI-2021","doi":null,"url":null,"internal_url":"/proceedings/2021/2"},{"position":5,"raw":"[Arya et al., 2001] V. Arya, N. Garg, R. Khandekar, A. Mey- erson, K. Munagala, and V. Pandit. Local search heuristic for k-median and facility location problems. In Proceed- ings of STOC-2001, pages 21-29, 2001.","title":"Local search heuristic for k-median and facility location problems","authors":"V Arya, N Garg, R Khandekar, A Meyerson, K Munagala, V Pandit","year":"2001","venue":"Proceedings of STOC-2001","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bartholdi et al., 1989] J. Bartholdi, III, C. Tovey, and M. 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":"J Bartholdi, C Iii, M Tovey, Trick","year":"1989","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Berg, 1985] S. Berg. Paradox of voting under an urn model: The effect of homogeneity. Public Choice, 47(2):377-387, 1985.","title":"Paradox of voting under an urn model: The effect of homogeneity","authors":"S Berg","year":"1985","venue":"Public Choice","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Black, 1958] D. Black. The Theory of Committees and Elec- tions. Cambridge University Press, 1958.","title":"The Theory of Committees and Elections","authors":"D Black","year":"1958","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Boehmer et al., 2021] N. Boehmer, R. Bredereck, P. Fal- iszewski, R. Niedermeier, and S. 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":"N Boehmer, R Bredereck, P Faliszewski, R Niedermeier, S Szufa","year":"2021","venue":"Proceedings of IJCAI-2021","doi":null,"url":null,"internal_url":"/proceedings/2021/9"},{"position":10,"raw":"[Boehmer et al., 2022] N. Boehmer, P. Faliszewski, R. Nie- dermeier, S. Szufa, and T. W ąs. Understanding distance measures among elections. In Proceedings of IJCAI-2022, pages 102-108, 2022.","title":"Understanding distance measures among elections","authors":"N Boehmer, P Faliszewski, R Niedermeier, S Szufa, T W Ąs","year":"2022","venue":"Proceedings of IJCAI-2022","doi":null,"url":null,"internal_url":"/proceedings/2022/15"},{"position":11,"raw":"Bosch, 2006","title":null,"authors":"Bosch","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"R. Bosch. Characterizations on Voting Rules and Consensus Measures. PhD thesis, Tilburg University, 2006.","title":"Characterizations on Voting Rules and Consensus Measures","authors":"R Bosch","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Byrka et al., 2017] J. Byrka, T. W. Pensyl, B. Rybicki, A. Srinivasan, and K. Trinh. An improved approxima- tion for k-median and positive correlation in budgeted op- timization. ACM Transactions on Algorithms, 13(2):23:1- 23:31, 2017.","title":"An improved approximation for k-median and positive correlation in budgeted op-timization","authors":"J Byrka, T W Pensyl, B Rybicki, A Srinivasan, K Trinh","year":"2017","venue":"ACM Transactions on Algorithms","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Can et al., 2015] B. Can, A. I. Ozkes, and T. Storcken. Mea- suring polarization in preferences. Mathematical Social Sciences, 78:76-79, 2015.","title":"Measuring polarization in preferences","authors":"B Can, A I Ozkes, T Storcken","year":"2015","venue":"Mathematical Social Sciences","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Can et al., 2017] B. Can, A. Ozkes, and T. Storcken. Gener- alized measures of polarization in preferences. Technical report, HAL, 2017.","title":"Generalized measures of polarization in preferences","authors":"B Can, A Ozkes, T Storcken","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Chamberlin and Courant, 1983] B. Chamberlin and P. Courant. Representative deliberations and representa- tive decisions: Proportional representation and the Borda rule. American Political Science Review, 77(3):718-733, 1983.","title":"Representative deliberations and representative decisions: Proportional representation and the Borda rule","authors":"B Chamberlin, P Courant","year":"1983","venue":"American Political Science Review","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Cohen-Addad et al., 2022] V. Cohen-Addad, A. Gupta, L. Hu, H. Oh, and D. Saulpic. An improved local search algorithm for k-median. In Proceedings of SODA-2022, pages 1556-1612, 2022.","title":"An improved local search algorithm for k-median","authors":"V Cohen-Addad, A Gupta, L Hu, H Oh, D Saulpic","year":"2022","venue":"Proceedings of SODA-2022","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Cohen-Addad et al., 2023] V. Cohen-Addad, F. Grandoni, E. Lee, and C. Schwiegelshohn. Breaching the 2 LMP ap- proximation barrier for facility location with applications to k-median. In Proceedings of SODA-2023, pages 940- 986, 2023.","title":"Breaching the 2 LMP approximation barrier for facility location with applications to k-median","authors":"V Cohen-Addad, F Grandoni, E Lee, C Schwiegelshohn","year":"2023","venue":"Proceedings of SODA-2023","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Conitzer, 2009] V. Conitzer. Eliciting single-peaked pref- erences using comparison queries. Journal of Artificial Intelligence Research, 35:161-191, 2009.","title":"Eliciting single-peaked preferences using comparison queries","authors":"V Conitzer","year":"2009","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Cygan et al., 2015] M. Cygan, F. V. Fomin, Ł. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh. Parameterized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"M Cygan, F V Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, M Pilipczuk, S Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Dwork et al., 2001] C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the Web. In Proceedings of WWW-2001, pages 613-622, 2001.","title":"Rank aggregation methods for the Web","authors":"C Dwork, R Kumar, M Naor, D Sivakumar","year":"2001","venue":"Proceedings of WWW-2001","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Dynes and Tierney, 1994] R. Dynes and K. Tierney, editors. Disasters, Collective Behavior, and Social Organization. University of Delaware Press, 1994.","title":"Disasters, Collective Behavior, and Social Organization","authors":null,"year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Endriss and Grandi, 2014] U. Endriss and U. Grandi. Bi- nary aggregation by selection of the most representative voters. In Proceedings of AAAI-2014, pages 668-674, 2014.","title":"Binary aggregation by selection of the most representative voters","authors":"U Endriss, U Grandi","year":"2014","venue":"Proceedings of AAAI-2014","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Erdélyi et al., 2015] G. Erdélyi, M. Fellows, J. Rothe, and L. Schend. Control complexity in Bucklin and fallback voting: An experimental analysis. Journal of Computer and System Sciences, 81(4):661-670, 2015.","title":"Control complexity in Bucklin and fallback voting: An experimental analysis","authors":"G Erdélyi, M Fellows, J Rothe, L Schend","year":"2015","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Esteban and Ray, 1994] J.-M. Esteban and D. Ray. On the measurement of polarization. Econometrica, 62(4):819- 851, 1994.","title":"On the measurement of polarization","authors":"J.-M Esteban, D Ray","year":"1994","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Faliszewski et al., 2017] P. Faliszewski, P. Skowron, A. Slinko, and N. Talmon. Multiwinner voting: A new challenge for social choice theory. In U. Endriss, editor, Trends in Computational Social Choice. AI Access Foundation, 2017.","title":"Multiwinner voting: A new challenge for social choice theory","authors":"P Faliszewski, P Skowron, A Slinko, N Talmon","year":"2017","venue":"Trends in Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Faliszewski et al., 2019] P. Faliszewski, P. Skowron, A. Slinko, S. Szufa, and N. Talmon. How similar are two elections? In Proceedings of AAAI-2019, pages 1909-1916, 2019.","title":"How similar are two elections?","authors":"P Faliszewski, P Skowron, A Slinko, S Szufa, N Talmon","year":"2019","venue":"Proceedings of AAAI-2019","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Faliszewski et al., 2023] P. Faliszewski, A. Kaczmarczyk, K. Sornat, S. Szufa, and T. W ąs. Diversity, agree- ment, and polarization in elections. Technical Report arXiv:2305.09780 [cs.GT], arXiv.org, May 2023.","title":"Diversity, agreement, and polarization in elections","authors":"P Faliszewski, A Kaczmarczyk, K Sornat, S Szufa, T W Ąs","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Gowda et al., 2023] K. N. Gowda, T. W. Pensyl, A. Srini- vasan, and K. Trinh. Improved bi-point rounding algo- rithms and a golden barrier for k-median. In Proceedings of SODA-2023, pages 987-1011, 2023.","title":"Improved bi-point rounding algorithms and a golden barrier for k-median","authors":"K N Gowda, T W Pensyl, A Srinivasan, K Trinh","year":"2023","venue":"Proceedings of SODA-2023","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Hashemi and Endriss, 2014] V. Hashemi and U. Endriss. Measuring diversity of preferences in a group. In Proceed- ings of ECAI-2014, pages 423-428, 2014.","title":"Measuring diversity of preferences in a group","authors":"V Hashemi, U Endriss","year":"2014","venue":"Proceedings of ECAI-2014","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Hemaspaandra et al., 2005] E. Hemaspaandra, H. Spakowski, and J. Vogel. The complexity of Kemeny elections. Theoretical Computer Science, 349(3):382-391, 2005.","title":"The complexity of Kemeny elections","authors":"E Hemaspaandra, H Spakowski, J Vogel","year":"2005","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Huremović and Ozkes, 2022] K. Huremović and A. I. Ozkes. Polarization in networks: Identification- alienation framework. Journal of Mathematical Eco- nomics, 102:102732, 2022.","title":"Polarization in networks: Identificationalienation framework","authors":"K Huremović, A I Ozkes","year":"2022","venue":"Journal of Mathematical Economics","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Karpov, 2017] A. Karpov. Preference diversity orderings. Group Decision and Negotiation, 26(4):753-774, 2017.","title":"Preference diversity orderings","authors":"A Karpov","year":"2017","venue":"Group Decision and Negotiation","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Keller et al., 2019] O. Keller, A. Hassidim, and N. Hazon. New approximations for coalitional manipulation in scor- ing rules. Journal of Artificial Intelligence Research, 64:109-145, 2019.","title":"New approximations for coalitional manipulation in scoring rules","authors":"O Keller, A Hassidim, N Hazon","year":"2019","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Kemeny, 1959] J. Kemeny. Mathematics without numbers. Daedalus, 88:577-591, 1959.","title":"Mathematics without numbers","authors":"J Kemeny","year":"1959","venue":"Daedalus","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Kenyon-Mathieu and Schudy, 2007] C. Kenyon-Mathieu and W. Schudy. How to rank with few errors. In Proceedings of STOC-2007, pages 95-103, 2007.","title":"How to rank with few errors","authors":"C Kenyon-Mathieu, W Schudy","year":"2007","venue":"Proceedings of STOC-2007","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Levin et al., 2021] S. A. Levin, H. V. Milner, and C. Perrings. The dynamics of political polariza- tion. Proceedings of the National Academy of Sciences, 118(50):e2116950118, 2021.","title":"The dynamics of political polarization","authors":"S A Levin, H V Milner, C Perrings","year":"2021","venue":"Proceedings of the National Academy of Sciences","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Mattei and Walsh, 2013] N. Mattei and T. Walsh. Preflib: A library for preferences. In Proceedings of ADT-2013, pages 259-270, 2013.","title":"Preflib: A library for preferences","authors":"N Mattei, T Walsh","year":"2013","venue":"Proceedings of ADT-2013","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[McCabe-Dansted and Slinko, 2006] J. McCabe-Dansted and A. Slinko. Exploratory analysis of similarities between social choice rules. Group Decision and Negotiation, 15:77-107, 2006.","title":"Exploratory analysis of similarities between social choice rules","authors":"J Mccabe-Dansted, A Slinko","year":"2006","venue":"Group Decision and Negotiation","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Musco et al., 2018] C. Musco, C. Musco, and C. E. Tsourakakis. Minimizing polarization and disagreement in social networks. In Proceedings of WWW-2018, pages 369-378, 2018.","title":"Minimizing polarization and disagreement in social networks","authors":"C Musco, C Musco, C E Tsourakakis","year":"2018","venue":"Proceedings of WWW-2018","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Procaccia et al., 2008] A. D. Procaccia, J. S. Rosenschein, and A. Zohar. On the complexity of achieving proportional representation. Social Choice and Welfare, 30(3):353- 362, 2008.","title":"On the complexity of achieving proportional representation","authors":"A D Procaccia, J S Rosenschein, A Zohar","year":"2008","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Skowron et al., 2015] P. Skowron, P. Faliszewski, and A. Slinko. Achieving fully proportional representation: Approximability result. Artificial Intelligence, 222:67- 103, 2015.","title":"Achieving fully proportional representation: Approximability result","authors":"P Skowron, P Faliszewski, A Slinko","year":"2015","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Szufa et al., 2020] S. Szufa, P. Faliszewski, P. Skowron, A. Slinko, and N. 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":"S Szufa, P Faliszewski, P Skowron, A Slinko, N Talmon","year":"2020","venue":"Proceedings of AAMAS-2020","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Tu and Neumann, 2022] S. Tu and S. Neumann. A viral marketing-based model for opinion dynamics in online so- cial networks. In Proceedings of WWW-2022, pages 1570- 1578, 2022.","title":"A viral marketing-based model for opinion dynamics in online social networks","authors":"S Tu, S Neumann","year":"2022","venue":"Proceedings of WWW-2022","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Walsh, 2011] T. Walsh. Where are the hard manipulation problems. Journal of Artificial Intelligence Research, 42(1):1-29, 2011.","title":"Where are the hard manipulation problems","authors":"T Walsh","year":"2011","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Walsh, 2015] T. Walsh. Generating single peaked votes. Technical Report arXiv:1503.02766 [cs.GT], arXiv.org, March 2015.","title":"Generating single peaked votes","authors":"T Walsh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Williamson and Shmoys, 2011] D. P. Williamson and D. B. Shmoys. The Design of Approximation Algorithms. Cam- bridge University Press, 2011.","title":"The Design of Approximation Algorithms","authors":"D P Williamson, D B Shmoys","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Zhu and Zhang, 2022] L. Zhu and Z. Zhang. A nearly-linear time algorithm for minimizing risk of conflict in social net- works. In Proceedings of KDD-2022, pages 2648-2656, 2022.","title":"A nearly-linear time algorithm for minimizing risk of conflict in social networks","authors":"L Zhu, Z Zhang","year":"2022","venue":"Proceedings of KDD-2022","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}