IDEAS home Printed from https://ideas.repec.org/a/bpj/bejtec/v20y2020i1p5n5.html
   My bibliography  Save this article

A Simple and Procedurally Fair Game Form for Nash Implementation of the No-Envy Solution

Author

Listed:
  • Hagiwara Makoto

    (Department of Industrial Engineering and Economics, School of Engineering, Tokyo Institute of Technology - Ookayama Campus, 2-12-1 Ookayama, Meguro-ku, Tokyo152-8552, Japan)

Abstract

We consider the allocation problem of infinitely divisible resources with at least three agents. For this problem, Thomson (Games and Economic Behavior, 52: 186-200, 2005) and Doğan (Games and Economic Behavior, 98: 165-171, 2016) propose “simple” but not “procedurally fair” game forms which implement the “no-envy” solution in Nash equilibria. By contrast, Galbiati (Economics Letters, 100: 72-75, 2008) constructs a procedurally fair but not simple game form which implements the no-envy solution in Nash equilibria. In this paper, we design a both simple and procedurally fair game form which implements the no-envy solution in Nash equilibria.

Suggested Citation

  • Hagiwara Makoto, 2020. "A Simple and Procedurally Fair Game Form for Nash Implementation of the No-Envy Solution," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 20(1), pages 1-5, January.
    • Handle: RePEc:bpj:bejtec:v:20:y:2020:i:1:p:5:n:5
    DOI: 10.1515/bejte-2019-0051
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/bejte-2019-0051
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.1515/bejte-2019-0051?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.

    More about this item

    Keywords

    Nash implementation; no-envy solution; procedural fairness; simple game form;
    All these keywords.

    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
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation

    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:bpj:bejtec:v:20:y:2020:i:1:p:5:n:5. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.