687 search results - page 5 / 138 » On The Complexity of Manipulating Elections |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
CACM
2004
13 years 7 months ago
2004
IANDC
2010
13 years 6 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
USS
2010
13 years 5 months ago
2010
On November 3, 2009, voters in Takoma Park, Maryland, cast ballots for mayor and city council members using the ScantegrityII voting system--the first time any end-to-end (e2e) vo...
AAAI
2010
13 years 9 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...