Sciweavers

Share
8 search results - page 1 / 2
» Junta distributions and the average-case complexity of manip...
Sort
View
ATAL
2006
Springer
10 years 5 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
FCT
2007
Springer
10 years 5 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
ATAL
2010
Springer
10 years 2 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...
ATAL
2008
Springer
10 years 3 months ago
A broader picture of the complexity of strategic behavior in multi-winner elections
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
ECAI
2010
Springer
10 years 2 months ago
An Empirical Study of the Manipulability of Single Transferable Voting
Abstract. Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences....
Toby Walsh
books