Monotonicity implies generalized strategy-proofness for correspondences
We show that Maskin monotone social choice correspondences on sufficiently rich domains satisfy a generalized strategy-proofness property, thus generalizing Muller and Satterthwaite's (1977) theorem to correspondences. The result is interpreted as a possibility theorem on the dominant-strategy implementability of monotone SCCs via set-valued mechanisms for agents who are completely ignorant about the finally selected outcome. Alternatively, the result yields a partial characterization of the restrictions entailed by Nash implementability of correspondences.
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): 2 ()
|Note:||Received: 3 November 1997/Accepted: 26 April 1999|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:17:y:2000:i:2:p:367-375. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.