9 search results - page 1 / 2 » How Hard Is Bribery in Elections |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
IWPEC
2010
Springer
13 years 2 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
AAAI
2006
13 years 5 months ago
2006
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
AAAI
2010
13 years 6 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
CORR
2012
Springer
12 years 6 days ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...