Preference Restrictions in Computational Social Choice: Recent Progress

The goal of this short paper is to provide an overview of recent progress in understanding and exploiting useful properties of restricted preference domains, such as, e.g., the domains of single-peaked, single-crossing and 1-Euclidean preferences.

[1]  Jean-Claude Falmagne,et al.  A Polynomial Time Algorithm for Unidimensional Unfolding Representations , 1994, J. Algorithms.

[2]  Edith Hemaspaandra,et al.  The complexity of Kemeny elections , 2005, Theor. Comput. Sci..

[3]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[4]  K. Arrow.  A Difficulty in the Concept of Social Welfare , 1950, Journal of Political Economy.

[5]  Nadja Betzler,et al.  On the Computation of Fully Proportional Representation , 2011, J. Artif. Intell. Res..

[6]  Edith Elkind,et al.  Multiwinner Elections Under Preferences That Are Single-Peaked on a Tree , 2013, IJCAI.

[7]  D. Black.  On the Rationale of Group Decision-making , 1948, Journal of Political Economy.

[8]  Piotr Faliszewski,et al.  The complexity of fully proportional representation for single-crossing electorates , 2013, Theor. Comput. Sci..

[9]  Arkadii M. Slinko,et al.  Generalizing the Single-Crossing Property on Lines and Trees to Intermediate Preferences on Median Graphs , 2015, IJCAI.

[10]  Piotr Faliszewski,et al.  Clone structures in voters' preferences , 2011, EC '12.

[11]  Fan-Chin Kung.  Sorting out single-crossing preferences on networks , 2015, Soc. Choice Welf..

[12]  Toby Walsh,et al.  Uncertainty in Preference Elicitation and Aggregation , 2007, AAAI.

[13]  Jörg Rothe,et al.  Exact Complexity of the Winner Problem for Young Elections , 2001, Theory of Computing Systems.

[14]  Piotr Faliszewski,et al.  Recognizing 1-Euclidean Preferences: An Alternative Approach , 2014, SAGT.

[15]  Michael A. Trick,et al.  Recognizing single-peaked preferences on a tree , 1989 .

[16]  H. Moulin.  Axioms of Cooperative Decision Making , 1988 .

[17]  Guillaume Haeringer,et al.  A characterization of the single-peaked domain , 2011, Soc. Choice Welf..

[18]  Edith Elkind,et al.  Preferences Single-Peaked on Nice Trees , 2016, AAAI.

[19]  C H COOMBS,et al.  Psychological scaling without a unit of measurement. , 1950, Psychological review.

[20]  Dominik Peters,et al.  Recognising Multidimensional Euclidean Preferences , 2016, AAAI.

[21]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[22]  Svetlana Obraztsova,et al.  Complexity of Finding Equilibria of Plurality Voting Under Structured Preferences , 2016, AAMAS.

[23]  Edith Hemaspaandra,et al.  Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates , 2010, AAAI.

[24]  Piotr Faliszewski,et al.  How Hard is Control in Single-Crossing Elections? , 2014, ECAI.

[25]  Piotr Faliszewski,et al.  The complexity of manipulative attacks in nearly single-peaked electorates , 2011, TARK XIII.

[26]  H. Moulin,et al.  Axioms of Cooperative Decision Making. , 1990 .

[27]  Piotr Faliszewski,et al.  The shield that never was: Societies with single-peaked preferences are more open to manipulation and control , 2011, Inf. Comput..

[28]  Jörg Rothe,et al.  Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP , 1997, JACM.

[29]  A. Gibbard.  Manipulation of Voting Schemes: A General Result , 1973 .

[30]  Kirk Pruhs,et al.  The one-dimensional Euclidean domain: finitely many obstructions are not enough , 2015, Soc. Choice Welf..

[31]  Jérôme Lang,et al.  Single-peaked consistency and its complexity , 2008, ECAI.

[32]  Kevin Roberts,et al.  Voting over income tax schedules , 1977 .

[33]  Jstor,et al.  Invention in the Industrial Research Laboratory , 1963, Journal of Political Economy.

[34]  J. Mirrlees.  An Exploration in the Theory of Optimum Income Taxation an Exploration in the Theory of Optimum Income Taxation L Y 2 , 2022 .

[35]  Gerhard J. Woeginger,et al.  A characterization of the single-crossing domain , 2013, Soc. Choice Welf..

[36]  Michael A. Trick,et al.  Stable matching with preferences derived from a psychological model , 1986 .

[37]  Gábor Erdélyi,et al.  Manipulation of k-Approval in Nearly Single-Peaked Electorates , 2015, ADT.

[38]  Piotr Faliszewski,et al.  A characterization of the single-peaked single-crossing domain , 2014, AAAI.

[39]  Gabrielle Demange,et al.  Single-peaked orders on a tree , 1982, Math. Soc. Sci..

[40]  Vicki Knoblauch,et al.  Recognizing one-dimensional Euclidean preference profiles , 2010 .

[41]  M. Trick,et al.  Voting schemes for which it can be difficult to tell who won the election , 1989 .

[42]  M. Satterthwaite.  Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .