Sciweavers

Share
39 search results - page 1 / 8
» Manipulation of copeland elections
Sort
View
ATAL
2010
Springer
10 years 29 days 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 1 months ago
Copeland voting: ties matter
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
CORR
2012
Springer
193views Education» more  CORR 2012»
8 years 7 months ago
Search versus Decision for Election Manipulation Problems
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis M...
CATS
2007
10 years 1 months ago
On The Complexity of Manipulating Elections
We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election’s outcome. All voting schemes are potentially manip...
Tom Coleman, Vanessa Teague
ATAL
2015
Springer
4 years 7 months ago
Sample Complexity for Winner Prediction in Elections
Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the prefer...
Palash Dey, Arnab Bhattacharyya
books