Sciweavers

76
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 9 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