The Complexity of Manipulative Attacks in Nearly Single-Peaked
Electorates

v1v2 (latest)

The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates

25 May 2011

Piotr Faliszewski

E. Hemaspaandra

L. Hemaspaandra

ArXiv (abs)PDF HTML

Papers citing "The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates"

12 / 12 papers shown

Title
Election Manipulation in Social Networks with Single-Peaked Agents V. Auletta Francesco Carbone Diodato Ferraioli 38 2 0 21 Aug 2023
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees P. Dey 35 1 0 13 Nov 2016
Modeling Single-Peakedness for Votes with Ties Zack Fitzsimmons E. Hemaspaandra 26 5 0 27 Apr 2016
Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates V. Menon Kate Larson 41 14 0 25 Nov 2015
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges Robert Bredereck Jiehua Chen Piotr Faliszewski Jiong Guo R. Niedermeier G. Woeginger 90 59 0 08 Jul 2014
Combinatorial Voter Control in Elections L. Bulteau Jiehua Chen Piotr Faliszewski R. Niedermeier Nimrod Talmon 93 30 0 26 Jun 2014
Single-Peaked Consistency for Weak Orders Is Easy Zack Fitzsimmons 39 17 0 18 Jun 2014
On the Computation of Fully Proportional Representation Nadja Betzler A. Slinko Johannes Uhlmann 113 201 0 04 Feb 2014
The Complexity of Fully Proportional Representation for Single-Crossing Electorates P. Skowron Lan Yu Piotr Faliszewski Edith Elkind 105 95 0 04 Jul 2013
Weighted Electoral Control Piotr Faliszewski E. Hemaspaandra L. Hemaspaandra 110 50 0 04 May 2013
Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control L. Hemaspaandra Rahman Lavaee Curtis Menton 158 34 0 25 Oct 2012
The Complexity of Controlling Candidate-Sequential Elections E. Hemaspaandra L. Hemaspaandra J. Rothe 119 17 0 29 Feb 2012