Where are the hard manipulation problems?
Artificial Intelligence
2012-04-18 v1 Computational Complexity
Computer Science and Game Theory
Multiagent Systems
Abstract
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 increasing concern that such results may not re ect the difficulty of manipulation in practice. In this tutorial, I survey recent results in this area.
Cite
@article{arxiv.1007.5114,
title = {Where are the hard manipulation problems?},
author = {Toby Walsh},
journal= {arXiv preprint arXiv:1007.5114},
year = {2012}
}
Comments
Invited tutorial at the Third International Workshop on Computational Social Choice 2010