8 search results - page 2 / 2 » Determining the Winner of a Dodgson Election is Hard |
AAAI
2006
13 years 7 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 7 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...
SIGECOM
2011
ACM
12 years 9 months ago
2011
ACM
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...