On Detecting Nearly Structured Preference Profiles

Structured preference domains, such as, for example, the domains of single-peaked and single-crossing preferences, are known to admit efficient algorithms for many problems in computational social choice. Some of these algorithms extend to preferences that are close to having the respective structural property, i.e., can be made to enjoy this property by performing minor changes to voters' preferences, such as deleting a small number of voters or candidates. However, it has recently been shown that finding the optimal number of voters or candidates to delete in order to achieve the desired structural property is NP-hard for many such domains. In this paper, we show that these problems admit efficient approximation algorithms. Our results apply to all domains that can be characterized in terms of forbidden configurations; this includes, in particular, single-peaked and single-crossing elections. For a large range of scenarios, our approximation results are optimal under a plausible complexity-theoretic assumption. We also provide parameterized complexity results for this class of problems.

[1]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[2]  Gerhard J. Woeginger,et al.  Are there any nicely structured preference profiles nearby? , 2013, Math. Soc. Sci..

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

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

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

[6]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

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

[8]  G. Thompson,et al.  The Theory of Committees and Elections. , 1959 .

[9]  Olivier Spanjaard,et al.  Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width , 2013, IJCAI.

[10]  Ken-ichi Inada.  THE SIMPLE MAJORITY DECISION RULE , 1969 .

[11]  Henning Fernau.  Parameterized algorithms for d-Hitting Set: The weighted case , 2010, Theor. Comput. Sci..

[12]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

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

[15]  Gábor Erdélyi,et al.  Computational Aspects of Nearly Single-Peaked Electorates , 2012, AAAI.

[16]  Ge Xia,et al.  Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..

[17]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[18]  Ken-ichi Inada,et al.  A Note on the Simple Majority Decision Rule , 1964 .

[19]  Arild Stubhaug.  Acta Mathematica , 1886, Nature.

[20]  L. A. Goodman,et al.  Social Choice and Individual Values , 1951 .

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

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

[23]  Amartya Sen,et al.  A Possibility Theorem on Majority Decisions , 1966 .

[24]  Magnus Wahlström,et al.  Algorithms, measures and upper bounds for satisfiability and related problems , 2007 .

[25]  Salvador Barberà,et al.  Author's Personal Copy Games and Economic Behavior Top Monotonicity: a Common Root for Single Peakedness, Single Crossing and the Median Voter Result , 2022 .

[26]  Piotr Faliszewski,et al.  The shield that never was: societies with single-peaked preferences are more open to manipulation and control , 2009, TARK '09.

[27]  Olivier Spanjaard,et al.  Bounded Single-Peaked Width and Proportional Representation , 2012, ECAI.

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

[29]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..