{"type":"ScholarlyArticle","title":"Correlating Preferences and Attributes: Nearly Single-Crossing Profiles","authors":[{"name":"Foram Lakhani","slug":"foram-lakhani","given":"Foram","family":"Lakhani","affiliation":"University of Oxford , Oxford , UK"},{"name":"Dominik Peters","slug":"dominik-peters","given":"Dominik","family":"Peters","affiliation":"University of Oxford , Oxford , UK"},{"name":"Edith Elkind","slug":"edith-elkind","given":"Edith","family":"Elkind","affiliation":"University of Oxford , Oxford , UK"}],"abstract":"We use social choice theory to develop correlation coefficients between ranked preferences and an ordinal attribute such as educational attainment or income level. For example, such correlations could be used to formalise statements such as \"voters' preferences over parties are better explained by age than by income level\". In the literature, preferences that are perfectly explained by a single-dimensional agent attribute are commonly taken to be single-crossing preferences. Thus, to quantify how well an attribute explains preferences, we can order the voters by the value of the attribute and compute how far the resulting ordered profile is from being single-crossing, for various commonly studied distance measures (Kendall tau distance, voter/alternative deletion, etc.). The goal of this paper is to evaluate the computational feasibility of this approach. To this end, we investigate the complexity of computing these distances, obtaining an essentially complete picture for the distances we consider.","doi":"10.24963/ijcai.2019/59","url":"https://ijcai.org/proceedings/2019/59","pdf":"https://ijcai.org/proceedings/2019/0059.pdf","markdown":"https://ijcai.org/proceedings/2019/59.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/59","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":59,"pages":{"first":414,"last":420},"keywords":["Agent-based and Multi-agent Systems: Computational Social Choice","Agent-based and Multi-agent Systems: Voting"],"videos":[],"references":[{"position":1,"raw":"[Bartholdi III et al., 1989] John Bartholdi III, Craig A. Tovey, and Michael A. 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":"Iii Bartholdi","year":"1989","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Biedl et al., 2009] Therese C. Biedl, Franz-Josef Branden- burg, and Xiaotie Deng. On the complexity of crossings in permutations. Discrete Mathematics, 309(7):1813-1823, 2009.","title":"On the complexity of crossings in permutations","authors":"Therese C Biedl, Franz-Josef Brandenburg, Xiaotie Deng","year":"2009","venue":"Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bredereck et al., 2016] Robert Bredereck, Jiehua Chen, and Gerhard J. Woeginger. Are there any nicely structured preference profiles nearby? Mathematical Social Sciences, 79:61-73, 2016.","title":"Are there any nicely structured preference profiles nearby","authors":"Robert Bredereck, Jiehua Chen, Gerhard J Woeginger","year":"2016","venue":"Mathematical Social Sciences","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cohen et al., 2019] Nathann Cohen, Edith Elkind, and Foram Lakhani. Single-crossing implementation, 2019. arXiv:1906.09671.","title":"Single-crossing implementation","authors":"Cohen","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cornaz et al., 2013] Denis Cornaz, Lucie Galand, and Olivier Spanjaard. Kemeny elections with bounded single- peaked or single-crossing width. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), pages 76-82, 2013.","title":"Kemeny elections with bounded singlepeaked or single-crossing width","authors":"Denis Cornaz, Lucie Galand, Olivier Spanjaard","year":"2013","venue":"Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[de Vaus, 2002] David de Vaus. Surveys in Social Research.","title":"Surveys in Social Research","authors":"David De, Vaus","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"Taylor & Francis, 2002. 5th edition.","title":null,"authors":"Francis Taylor","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Diestel, 2012] Reinhard Diestel. Graph Theory. Springer, 2012.","title":"Graph Theory","authors":"Reinhard Diestel","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Downey and Fellows, 2013] Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.","title":"Fundamentals of Parameterized Complexity","authors":"Rodney G Downey, Michael R Fellows","year":"2013","venue":"Texts in Computer Science","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Elkind et al., 2012] Edith Elkind, Piotr Faliszewski, and Arkadii Slinko. Clone structures in voters' preferences. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pages 496-513. ACM, 2012.","title":"Clone structures in voters' preferences","authors":"Elkind","year":"2012","venue":"Proceedings of the 13th ACM Conference on Electronic Commerce (EC)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Elkind et al., 2016] Edith Elkind, Martin Lackner, and Do- minik Peters. Preference restrictions in computational social choice: Recent progress. In Proceedings of the 25th Inter- national Joint Conference on Artificial Intelligence (IJCAI), pages 4062-4065, 2016.","title":"Preference restrictions in computational social choice: Recent progress","authors":"Elkind","year":"2016","venue":"Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2016/601"},{"position":12,"raw":"[Elkind et al., 2017] Edith Elkind, Martin Lackner, and Do- minik Peters. Structured preferences. In U. Endriss, editor, Trends in Computational Social Choice, chapter 10, pages 187-207. AI Access, 2017.","title":"Structured preferences","authors":"Elkind","year":"2017","venue":"Trends in Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Erdélyi et al., 2017] Gábor Erdélyi, Martin Lackner, and An- dreas Pfandler. Computational aspects of nearly single- peaked electorates. Journal of Artificial Intelligence Re- search, 58:297-337, 2017.","title":"Computational aspects of nearly singlepeaked electorates","authors":"Gábor Erdélyi, Martin Lackner, Andreas Pfandler","year":"2017","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Faliszewski et al., 2014] Piotr Faliszewski, Edith Hemas- paandra, and Lane A. Hemaspaandra. The complexity of manipulative attacks in nearly single-peaked electorates. Artificial Intelligence, 207:69-99, 2014.","title":"The complexity of manipulative attacks in nearly single-peaked electorates","authors":"Piotr Faliszewski, Edith Hemaspaandra, Lane A Hemaspaandra","year":"2014","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Garey et al., 1976] Michael R. Garey, David S. Johnson, and Larry J. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1(3):237-267, 1976.","title":"Some simplified NP-complete graph problems","authors":"R Michael, David S Garey, Larry J Johnson, Stockmeyer","year":"1976","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Healey, 2008] Joseph F. Healey. Statistics: A Tool for Social Research. Cengage Learning, 2008. 8th edition.","title":"Statistics: A Tool for Social Research","authors":"Joseph F Healey","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Jaeckle et al., 2018] Florian Jaeckle, Dominik Peters, and Edith Elkind. On recognising nearly single-crossing pref- erences. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI), pages 1079-1086, 2018.","title":"On recognising nearly single-crossing preferences","authors":"Florian Jaeckle, Dominik Peters, Edith Elkind","year":"2018","venue":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Mirrlees, 1971] James A Mirrlees. An exploration in the the- ory of optimum income taxation. The Review of Economic Studies, 38(2):175-208, 1971.","title":"An exploration in the theory of optimum income taxation","authors":"A James, Mirrlees","year":"1971","venue":"The Review of Economic Studies","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Skowron et al., 2015] Piotr Skowron, Lan Yu, Piotr Fal- iszewski, and Edith Elkind. The complexity of fully propor- tional representation for single-crossing electorates. Theo- retical Computer Science, 569:43-57, 2015.","title":"The complexity of fully proportional representation for single-crossing electorates","authors":"Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind","year":"2015","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}