Sciweavers

160 search results - page 2 / 32
» Approximability of Manipulating Elections
Sort
View
ATAL
2006
Springer
13 years 8 months ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein
AAAI
2012
11 years 7 months ago
Evaluating Resistance to False-Name Manipulations in Elections
In many mechanisms (especially online mechanisms), a strategic agent can influence the outcome by creating multiple false identities. We consider voting settings where the mechan...
Bo Waggoner, Lirong Xia, Vincent Conitzer
ATAL
2010
Springer
13 years 6 months ago
Manipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
CORR
2002
Springer
125views Education» more  CORR 2002»
13 years 4 months ago
Complexity of Manipulating Elections with Few Candidates
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
Vincent Conitzer, Tuomas Sandholm
FOCS
2008
IEEE
13 years 11 months ago
Elections Can be Manipulated Often
Ehud Friedgut, Gil Kalai, Noam Nisan