8 search results - page 2 / 2 » Junta distributions and the average-case complexity of manip... |
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
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...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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...