ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0909.3257
  4. Cited By
The Shield that Never Was: Societies with Single-Peaked Preferences are
  More Open to Manipulation and Control
v1v2 (latest)

The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control

17 September 2009
Piotr Faliszewski
E. Hemaspaandra
L. Hemaspaandra
J. Rothe
ArXiv (abs)PDFHTML

Papers citing "The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control"

21 / 21 papers shown
Title
On the Parallelizability of Approval-Based Committee Rules
On the Parallelizability of Approval-Based Committee Rules
Zack Fitzsimmons
Zohair Raza Hassan
E. Hemaspaandra
100
0
0
25 Jan 2025
Election Manipulation in Social Networks with Single-Peaked Agents
Election Manipulation in Social Networks with Single-Peaked Agents
V. Auletta
Francesco Carbone
Diodato Ferraioli
38
2
0
21 Aug 2023
Towards secure judgments aggregation in AHP
Towards secure judgments aggregation in AHP
K. Kułakowski
J. Szybowski
Jirí Mazurek
Sebastian Ernst
44
6
0
27 Mar 2023
Proportionality and Strategyproofness in Multiwinner Elections
Proportionality and Strategyproofness in Multiwinner Elections
Dominik Peters
56
55
0
17 Apr 2021
A Parameterized Perspective on Protecting Elections
A Parameterized Perspective on Protecting Elections
P. Dey
Neeldhara Misra
Swaprava Nath
Garima Shakya
AAML
74
10
0
28 May 2019
Election Score Can Be Harder Than Winner
Election Score Can Be Harder Than Winner
Zack Fitzsimmons
E. Hemaspaandra
44
2
0
22 Jun 2018
Modeling Single-Peakedness for Votes with Ties
Modeling Single-Peakedness for Votes with Ties
Zack Fitzsimmons
E. Hemaspaandra
20
5
0
27 Apr 2016
Reinstating Combinatorial Protections for Manipulation and Bribery in
  Single-Peaked and Nearly Single-Peaked Electorates
Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates
V. Menon
Kate Larson
32
14
0
25 Nov 2015
Complexity of Manipulative Actions When Voting with Ties
Complexity of Manipulative Actions When Voting with Ties
Zack Fitzsimmons
E. Hemaspaandra
39
15
0
15 Jun 2015
Elections with Few Voters: Candidate Control Can Be Easy
Elections with Few Voters: Candidate Control Can Be Easy
Jiehua Chen
Piotr Faliszewski
R. Niedermeier
Nimrod Talmon
109
65
0
28 Nov 2014
Parameterized Algorithmics for Computational Social Choice: Nine
  Research Challenges
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Robert Bredereck
Jiehua Chen
Piotr Faliszewski
Jiong Guo
R. Niedermeier
G. Woeginger
81
59
0
08 Jul 2014
Combinatorial Voter Control in Elections
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
Single-Peaked Consistency for Weak Orders Is Easy
Zack Fitzsimmons
33
17
0
18 Jun 2014
Cloning in Elections: Finding the Possible Winners
Cloning in Elections: Finding the Possible Winners
Edith Elkind
Piotr Faliszewski
A. Slinko
96
69
0
18 Jan 2014
Weighted Electoral Control
Weighted Electoral Control
Piotr Faliszewski
E. Hemaspaandra
L. Hemaspaandra
104
50
0
04 May 2013
The Complexity of Controlling Candidate-Sequential Elections
The Complexity of Controlling Candidate-Sequential Elections
E. Hemaspaandra
L. Hemaspaandra
J. Rothe
104
17
0
29 Feb 2012
The Complexity of Manipulative Attacks in Nearly Single-Peaked
  Electorates
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates
Piotr Faliszewski
E. Hemaspaandra
L. Hemaspaandra
141
91
0
25 May 2011
Control Complexity in Bucklin and Fallback Voting
Control Complexity in Bucklin and Fallback Voting
G. Erdélyi
M. Fellows
J. Rothe
Lena Schend
145
17
0
11 Mar 2011
Where are the hard manipulation problems?
Where are the hard manipulation problems?
T. Walsh
103
72
0
29 Jul 2010
Is Computational Complexity a Barrier to Manipulation?
Is Computational Complexity a Barrier to Manipulation?
T. Walsh
109
29
0
05 Jul 2010
The Complexity of Manipulating $k$-Approval Elections
The Complexity of Manipulating kkk-Approval Elections
Andrew Lin
114
44
0
23 May 2010
1