Sciweavers

205 search results - page 4 / 41
» Elections Can be Manipulated Often
Sort
View
JCSS
2010
112views more  JCSS 2010»
14 years 9 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
CLIMA
2010
14 years 11 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
CORR
2012
Springer
249views Education» more  CORR 2012»
13 years 6 months ago
Controlling Candidate-Sequential Elections
All previous work on “candidate-control” manipulation of elections has been in the model of full-information, simultaneous voting. This is a problem, since in quite a few real...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
ATAL
2008
Springer
15 years 29 days ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
DAS
2010
Springer
15 years 2 months ago
Improved classification through runoff elections
We consider the problem of dealing with irrelevant votes when a multi-case classifier is built from an ensemble of binary classifiers. We show how run-off elections can be used to...
Oleg Golubitsky, Stephen M. Watt