Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
The Gibbard-Satterthwaite Theorem on the manipulability of social-choice rules assumes resoluteness: there are no ties, no multi-member choice sets. Generalizations based on a familiar lottery idea allow ties but assume perfectly shared probabilistic beliefs about their resolution. We prove a more straightforward generalization that assumes almost no limit on ties or beliefs about them.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 17 (2000)
Issue (Month): 1 ()
|Note:||Received: 15 December 1997/Accepted: 16 November 1998|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/355|