Work

Where are the hard manipulation problems?

Year: 2010
Type: preprint
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.
Author: Walsh, Toby
Institutions: UNSW Sydney, Data61
Language: English
Open Access status: green
OpenAlex ID: W2952174202
Cites: 16
Cited by: 19
Related to: 20