Sciweavers

687 search results - page 2 / 138
» On The Complexity of Manipulating Elections
Sort
View
ATAL
2008
Springer
13 years 7 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...
JAIR
2008
117views more  JAIR 2008»
13 years 5 months ago
Complexity of Strategic Behavior in Multi-Winner Elections
Although recent years have seen a surge of interest in the computational aspects of social choice, no specific attention has previously been devoted to elections with multiple win...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
ECAI
2010
Springer
13 years 6 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
ATAL
2008
Springer
13 years 7 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...
AAAI
2010
13 years 3 months ago
Cloning in Elections
We consider the problem of manipulating elections via cloning candidates. In our model, a manipulator can replace each candidate c by one or more clones, i.e., new candidates that...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko