Sciweavers

Share
8 search results - page 2 / 2
» Junta distributions and the average-case complexity of manip...
Sort
View
ATAL
2008
Springer
10 years 4 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...
ATAL
2008
Springer
10 years 4 months 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
CORR
2010
Springer
116views Education» more  CORR 2010»
10 years 2 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
books