IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v28y2006i2p453-460.html
   My bibliography  Save this article

Nash implementing non-monotonic social choice rules by awards

Author

Listed:
  • M. Sanver

Abstract

By a slight generalization of the definition of implementation (called implementation by awards), Maskin monotonicity is no more needed for Nash implementation. In fact, a weaker condition, to which we refer as almost monotonicity is both necessary and sufficient for social choice correspondences to be Nash implementable by awards. Hence our framework paves the way to the Nash implementation of social choice rules which otherwise fail to be Nash implementable. In particular, the Pareto social choice rule, the majority rule and the strong core are almost monotonic (hence Nash implementable by awards) while they are not Maskin monotonic (hence fail to be Nash implementable in the standard framework). Copyright Springer-Verlag Berlin/Heidelberg 2006

Suggested Citation

  • M. Sanver, 2006. "Nash implementing non-monotonic social choice rules by awards," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 28(2), pages 453-460, June.
    • Handle: RePEc:spr:joecth:v:28:y:2006:i:2:p:453-460
    DOI: 10.1007/s00199-005-0626-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00199-005-0626-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00199-005-0626-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mezzetti, Claudio & Renou, Ludovic, 2012. "Implementation in mixed Nash equilibrium," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2357-2375.
    2. Laslier, Jean-François & Núñez, Matías & Remzi Sanver, M., 2021. "A solution to the two-person implementation problem," Journal of Economic Theory, Elsevier, vol. 194(C).
    3. Cabrales, Antonio & Serrano, Roberto, 2011. "Implementation in adaptive better-response dynamics: Towards a general theory of bounded rationality in mechanisms," Games and Economic Behavior, Elsevier, vol. 73(2), pages 360-374.
    4. Michele Lombardi & Naoki Yoshihara, 2013. "A full characterization of nash implementation with strategy space reduction," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(1), pages 131-151, September.
    5. Yi, Jianxin, 2011. "Implementation via mechanisms with transfers," Mathematical Social Sciences, Elsevier, vol. 61(1), pages 65-70, January.
    6. Chen, Yi-Chun & Kunimoto, Takashi & Sun, Yifei & Xiong, Siyang, 2022. "Maskin meets Abreu and Matsushima," Theoretical Economics, Econometric Society, vol. 17(4), November.
    7. M. Remzi Sanver, 2018. "Implementing Pareto Optimal and Individually Rational Outcomes by Veto," Group Decision and Negotiation, Springer, vol. 27(2), pages 223-233, April.
    8. Núñez, Matías & Pimienta, Carlos & Xefteris, Dimitrios, 2022. "On the implementation of the median," Journal of Mathematical Economics, Elsevier, vol. 99(C).
    9. Sanver, M. Remzi, 2008. "Nash implementability of the plurality rule over restricted domains," Economics Letters, Elsevier, vol. 99(2), pages 298-300, May.
    10. M. Remzi Sanver, 2017. "Nash implementing social choice rules with restricted ranges," Review of Economic Design, Springer;Society for Economic Design, vol. 21(1), pages 65-72, March.
    11. Artemov, Georgy, 2014. "An impossibility result for virtual implementation with status quo," Economics Letters, Elsevier, vol. 122(3), pages 380-385.
    12. İpek Özkal-Sanver & M. Sanver, 2010. "A new monotonicity condition for tournament solutions," Theory and Decision, Springer, vol. 69(3), pages 439-452, September.
    13. Artemov, Georgy, 2015. "Time and Nash implementation," Games and Economic Behavior, Elsevier, vol. 91(C), pages 229-236.
    14. Massó, Jordi & Nicolò, Antonio, 2008. "Efficient and stable collective choices under gregarious preferences," Games and Economic Behavior, Elsevier, vol. 64(2), pages 591-611, November.
    15. Jordi Massó & Antonio Nicolò, 2004. "Efficient and Stable Collective Choices under Crowding Preferences," Working Papers 148, Barcelona School of Economics.
    16. Benoît, Jean-Pierre & Ok, Efe A., 2008. "Nash implementation without no-veto power," Games and Economic Behavior, Elsevier, vol. 64(1), pages 51-67, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:28:y:2006:i:2:p:453-460. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.