The control complexity of r-Approval: From the single-peaked case to the general case

A natural generalization of the single-peaked elections is the k-peaked elections, where at most k peaks are allowed in each vote. Motivated by NP-hardness in general and polynomial-time solvability in single-peaked elections, we aim at establishing a complexity dichotomy of several control problems for r-Approval voting in k-peaked elections with respect to k. It turns out that most NP-completeness results in general also hold in k-peaked elections, even for k=2,3. On the other hand, we derive polynomial-time algorithms for certain control problems for k=2. In addition, we also study the problems from the viewpoint of parameterized complexity and achieve both FPT and W-hardness results. Several of our results apply to approval voting and sincere-strategy preference-based approval voting as well.

[1]  Yongjie Yang,et al.  Controlling elections with bounded single-peaked width , 2014, AAMAS.

[2]  Toby Walsh,et al.  How Hard Is It to Control an Election by Breaking Ties? , 2013, ECAI.

[3]  Jianer Chen,et al.  Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching , 2012, TALG.

[4]  Yongjie Yang.  Election Attacks with Few Candidates , 2014, ECAI.

[5]  Yongjie Yang,et al.  Possible winner problems on partial tournaments: a parameterized study , 2017, J. Comb. Optim..

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

[7]  Patrick J. Egan,et al.  “Do Something” Politics and Double-Peaked Policy Preferences , 2014, The Journal of Politics.

[8]  John W. Patty,et al.  Arrow ’ s Theorem on Single-Peaked Domains , 2008 .

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

[10]  Weijia Jia,et al.  An efficient parameterized algorithm for m-set packing , 2004, J. Algorithms.

[11]  Jianer Chen,et al.  Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms , 2006, IWPEC.

[12]  Robert D. Cooter,et al.  The Strategic Constitution , 2000 .

[13]  Alexander Artikis,et al.  Voting in Multi-Agent Systems , 2006, Comput. J..

[14]  Jörg Rothe,et al.  Anyone but him: The complexity of precluding an alternative , 2005, Artif. Intell..

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

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

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

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

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

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

[21]  J. Mark Keil,et al.  On the complexity of scheduling tasks with discrete starting times , 1992, Oper. Res. Lett..

[22]  Christophe Picouleau.  Complexity of the Hamiltonian Cycle in Regular Graph Problem , 1994, Theor. Comput. Sci..

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

[24]  Andrew Lin,et al.  The Complexity of Manipulating k-Approval Elections , 2010, ICAART.

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Dimitrios M. Thilikos,et al.  Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems , 2008, Algorithmica.

[27]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[28]  Y. Narahari,et al.  Kernelization complexity of possible winner and coalitional manipulation problems in voting , 2014, Theor. Comput. Sci..

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

[30]  Michael R. Fellows,et al.  Finding k Disjoint Triangles in an Arbitrary Graph , 2004, WG.

[31]  Piotr Faliszewski,et al.  Large-Scale Election Campaigns: Combinatorial Shift Bribery , 2015, AAMAS.

[32]  Minming Li,et al.  Facility location with double-peaked preferences , 2017 .

[33]  P. Strevens.  Iii , 1985 .

[34]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[35]  Qiang Zhang,et al.  Facility location with double-peaked preference , 2015, ArXiv.

[36]  Jörg Rothe,et al.  Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control , 2008, Math. Log. Q..

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

[38]  Rolf Niedermeier,et al.  Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective , 2012, The Multivariate Algorithmic Revolution and Beyond.

[39]  Yongjie Yang,et al.  Manipulation with Bounded Single-Peaked Width: A Parameterized Study , 2015, AAMAS.

[40]  Joachim Gudmundsson,et al.  Computational Aspects of Multi-Winner Approval Voting , 2014, MPREF@AAAI.

[41]  Neeldhara Misra,et al.  On the Parameterized Complexity of Minimax Approval Voting , 2015, AAMAS.

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

[43]  Hong Liu,et al.  Parameterized complexity of control problems in Maximin election , 2010, Inf. Process. Lett..

[44]  Lirong Xia,et al.  Designing social choice mechanisms using machine learning , 2013, AAMAS.

[45]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[46]  Hong Liu,et al.  Parameterized computational complexity of control problems in voting systems , 2009, Theor. Comput. Sci..

[47]  Nadja Betzler,et al.  Parameterized complexity of candidate control in elections and related digraph problems , 2008, Theor. Comput. Sci..

[48]  Michael A. Trick,et al.  How hard is it to control an election? Math , 1992 .

[49]  Sven Koenig,et al.  Greedy localization , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[50]  Jörg Rothe,et al.  Control complexity in Bucklin and fallback voting: A theoretical analysis , 2015, J. Comput. Syst. Sci..

[51]  Steven J. Brams,et al.  Critical Strategies Under Approval Voting: Who Gets Ruled In And Ruled Out , 2006 .

[52]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[53]  Yongjie Yang,et al.  On the Complexity of Borda Control in Single-Peaked Elections , 2017, AAMAS.

[54]  George Popescu,et al.  Group Recommender Systems as a Voting Problem , 2013, HCI.

[55]  Michael R. Fellows,et al.  Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover , 2004, IWPEC.