IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v77y2018icp25-31.html
   My bibliography  Save this article

Procedurally fair implementation under complete information

Author

Listed:
  • Korpela, Ville

Abstract

We derive a necessary and a sufficient condition for Nash implementation with a procedurally fair mechanism. Our result has a nice analogue with the path-braking result of Maskin (1999), and therefore, it allows us to give a simple characterization of those choice rules that are implementable, but not in a procedurally fair way. This reveals the constraints that insisting on procedural fairness impose on the collective.

Suggested Citation

  • Korpela, Ville, 2018. "Procedurally fair implementation under complete information," Journal of Mathematical Economics, Elsevier, vol. 77(C), pages 25-31.
  • Handle: RePEc:eee:mateco:v:77:y:2018:i:c:p:25-31
    DOI: 10.1016/j.jmateco.2018.06.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406816301264
    Download Restriction: Full text for ScienceDirect subscribers only

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

    References listed on IDEAS

    as
    1. Tatamitani, Yoshikatsu, 2001. "Implementation by self-relevant mechanisms," Journal of Mathematical Economics, Elsevier, vol. 35(3), pages 427-444, June.
    2. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506, Elsevier.
    3. Sébastien Rouillon, 2013. "Anonymous implementation of the Lindahl correspondence: possibility and impossibility results," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(4), pages 1179-1203, April.
    4. Sakai, Toyotaka, 2007. "Fairness and implementability in allocation of indivisible objects with monetary compensations," Journal of Mathematical Economics, Elsevier, vol. 43(5), pages 549-563, June.
    5. Rahul Deb & Mallesh M. Pai, 2017. "Discrimination via Symmetric Auctions," American Economic Journal: Microeconomics, American Economic Association, vol. 9(1), pages 275-314, February.
    6. M. Fleurbaey & F. Maniquet, 1997. "Implementability and Horizontal Equity Imply No-Envy," Econometrica, Econometric Society, vol. 65(5), pages 1215-1220, September.
    7. Moulin, HervÈ, 1997. "Procedural cum Endstate Justice: An Implementation Viewpoint," Working Papers 97-17, Duke University, Department of Economics.
    8. Yan Chen, 2002. "A family of supermodular Nash mechanisms implementing Lindahl allocations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 19(4), pages 773-790.
    9. Galbiati, Marco, 2008. "Fair divisions as attracting Nash equilibria of simple games," Economics Letters, Elsevier, vol. 100(1), pages 72-75, July.
    10. Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," Review of Economic Studies, Oxford University Press, vol. 66(1), pages 23-38.
    11. Muller, Eitan & Satterthwaite, Mark A., 1977. "The equivalence of strong positive association and strategy-proofness," Journal of Economic Theory, Elsevier, vol. 14(2), pages 412-418, April.
    12. Frédéric Gaspart, 2003. "A general concept of procedural fairness for one-stage implementation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 311-322, October.
    13. Saijo, Tatsuyoshi & Tatamitani, Yoshikatsu & Yamato, Takehiko, 1996. "Toward Natural Implementation," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 37(4), pages 949-980, November.
    14. Azrieli, Yaron & Jain, Ritesh, 2018. "Symmetric mechanism design," Journal of Mathematical Economics, Elsevier, vol. 74(C), pages 108-118.
    15. Mathevet, Laurent A., 2010. "Supermodular mechanism design," Theoretical Economics, Econometric Society, vol. 5(3), September.
    16. Guoqiang Tian, 1989. "Implementation of the Lindahl Correspondence by a Single-Valued, Feasible, and Continuous Mechanism," Review of Economic Studies, Oxford University Press, vol. 56(4), pages 613-621.
    17. John Pratt, 2007. "Fair (and not so fair) division," Journal of Risk and Uncertainty, Springer, vol. 35(3), pages 203-236, December.
    Full references (including those not matched with items on IDEAS)

    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:eee:mateco:v:77:y:2018:i:c:p:25-31. 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: (Haili He). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.