Nash Implementation with Lottery Mechanisms
Consider the problem of exact Nash Implementation of social choice correspondences. Define a lottery mechanism as a mechanism in which the planner can randomize on alternatives out of equilibrium while pure alternatives are always chosen in equilibrium. When preferences over alternatives are strict, we show that Maskin monotonicity (Maskin, 1999) is both necessary and sufficient for a social choice correspondence to be Nash implementable. We discuss how to relax the assumption of strict preferences. Next, we examine social choice correspondences with private components. Finally, we apply our method to the issue of voluntary implementation (Jackson and Palfrey, 2001).
|Date of creation:||2005|
|Date of revision:|
|Contact details of provider:|| Postal: P.O. Box 616, 6200 MD Maastricht|
Phone: +31 (0)43 38 83 830
Web page: http://www.maastrichtuniversity.nl/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:unm:umamet:2005036. 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: (Charles Bollen)
If references are entirely missing, you can add them using this form.