Sciweavers

160 search results - page 1 / 32
» Approximability of Manipulating Elections
Sort
View
AAAI
2008
13 years 6 months ago
Approximability of Manipulating Elections
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaan...
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 6 days ago
Search versus Decision for Election Manipulation Problems
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis M...
CATS
2007
13 years 6 months ago
On The Complexity of Manipulating Elections
We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election’s outcome. All voting schemes are potentially manip...
Tom Coleman, Vanessa Teague
AAAI
2010
13 years 6 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 4 months ago
An Empirical Study of Borda Manipulation
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form o...
Jessica Davies, George Katsirelos, Nina Narodytska...