IDEAS home Printed from https://ideas.repec.org/p/tut/cremwp/201201.html
   My bibliography  Save this paper

On Partial Honesty Nash Implementation

Author

Listed:
  • Ahmed Doghmi

    (National Institute of Statistics and Applied Economics, Madinat Al Irfane, Rabat Institutes, 13000 Rabat, Morocco)

  • Abderrahmane ZIAD

    (University of Caen Basse-Normandie, CREM (UMR CNRS))

Abstract

An agent is said to be partially honest if he or she weakly prefers an outcome at a strategy profile with his truthful strategy than an outcome at a strategy profile with his false strategy, then this player must prefer strictly the \true" strategy profille to the \false" strategy profile. In this paper we consider an exchange economy with single peaked preferences. With many agents (n ≥3), if there exists at least one partially honest agent, we prove that any solution of the problem of fair division satisfying unanimity is Nash implementable.

Suggested Citation

  • Ahmed Doghmi & Abderrahmane ZIAD, 2012. "On Partial Honesty Nash Implementation," Economics Working Paper Archive (University of Rennes 1 & University of Caen) 201201, Center for Research in Economics and Management (CREM), University of Rennes 1, University of Caen and CNRS.
  • Handle: RePEc:tut:cremwp:201201
    as

    Download full text from publisher

    File URL: https://crem-doc.univ-rennes1.fr/wp/2012/201201.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. Dutta, Bhaskar & Sen, Arunava, 2012. "Nash implementation with partially honest individuals," Games and Economic Behavior, Elsevier, vol. 74(1), pages 154-169.
    2. William Thomson, 2010. "Implementation of solutions to the problem of fair division when preferences are single-peaked," Review of Economic Design, Springer;Society for Economic Design, vol. 14(1), pages 1-15, March.
    3. Matsushima, Hitoshi, 2008. "Role of honesty in full implementation," Journal of Economic Theory, Elsevier, vol. 139(1), pages 353-359, March.
    4. Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," Review of Economic Studies, Oxford University Press, vol. 66(1), pages 23-38.
    5. Yamato, Takehiko, 1992. "On nash implementation of social choice correspondences," Games and Economic Behavior, Elsevier, vol. 4(3), pages 484-492, July.
    6. Doghmi, Ahmed & Ziad, Abderrahmane, 2008. "Reexamination of Maskin's Theorem on Nash implementability," Economics Letters, Elsevier, vol. 100(1), pages 150-152, July.
    7. Doghmi, Ahmed & Ziad, Abderrahmane, 2008. "Nash implementation in exchange economies with single-peaked preferences," Economics Letters, Elsevier, vol. 100(1), pages 157-160, July.
    8. Danilov, Vladimir, 1992. "Implementation via Nash Equilibria," Econometrica, Econometric Society, vol. 60(1), pages 43-56, January.
    9. Lombardi, Michele, 2010. "Two-agent Nash implementation with partially-honest agents: Almost Full Characterizations," MPRA Paper 27834, University Library of Munich, Germany.
    10. Bhaskar Dutta & Arunava Sen, 1991. "A Necessary and Sufficient Condition for Two-Person Nash Implementation," Review of Economic Studies, Oxford University Press, vol. 58(1), pages 121-128.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Ahmed Doghmi & Abderrahmane Ziad, 2013. "Nash Implementation in Private Good Economies with Single-Plateaued Preferences," Economics Working Paper Archive (University of Rennes 1 & University of Caen) 201311, Center for Research in Economics and Management (CREM), University of Rennes 1, University of Caen and CNRS.
    2. Diss, Mostapha & Doghmi, Ahmed & Tlidi, Abdelmonaim, 2016. "Strategy proofness and unanimity in many-to-one matching markets," MPRA Paper 75927, University Library of Munich, Germany, revised 08 Dec 2016.
    3. Ahmed Doghmi, 2013. "Nash Implementation in an Allocation Problem with Single-Dipped Preferences," Games, MDPI, Open Access Journal, vol. 4(1), pages 1-12, January.

    More about this item

    Keywords

    Nash implementation; Partial honesty; Single-peaked preferences;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:tut:cremwp:201201. 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: (CODA-POIREY Hélène). General contact details of provider: http://edirc.repec.org/data/crmrefr.html .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.