IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00798338.html

Anonymous implementation of the Lindahl correspondence: possibility and impossibility results

Author

Listed:
  • Sébastien Rouillon

    (GREThA - Groupe de Recherche en Economie Théorique et Appliquée - UB - Université de Bordeaux - CNRS - Centre National de la Recherche Scientifique)

Abstract

This paper deals with the existence of anonymous mechanisms to realize the Lindahl correspondence. We consider, in turn, constant and decreasing returns to scale technologies for producing public goods. In each case, we provide a continuous (but not smooth) and weakly balanced mechanism, which meets the two conditions. We then remark that they satisfy a property (see property NC), which is related to, but in fact stronger than anonymity. Finally, we prove that if a mechanism has this property, if it is weakly balanced and implements the Lindahl correspondence, then it cannot be differentiable around Nash equilibria.

Suggested Citation

  • Sébastien Rouillon, 2013. "Anonymous implementation of the Lindahl correspondence: possibility and impossibility results," Post-Print hal-00798338, HAL.
    • Handle: RePEc:hal:journl:hal-00798338
    DOI: 10.1007/s00355-012-0662-6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

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


    Cited by:

    1. Takuma Wakayama & Takehiko Yamato, 2023. "Comparison of the voluntary contribution and Pareto-efficient mechanisms under voluntary participation," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 517-553, June.
    2. Korpela, Ville, 2018. "Procedurally fair implementation under complete information," Journal of Mathematical Economics, Elsevier, vol. 77(C), pages 25-31.
    3. Korpela Ville, 2016. "Procedurally Fair Implementation: The Cost of Insisting on Symmetry," Discussion Papers 108, Aboa Centre for Economics.
    4. Hassan Benchekroun & Charles Figuières & Mabel Tidball, 2016. "Implementation of the Lindahl Correspondance via Simple Indirect Mechanisms," AMSE Working Papers 1637, Aix-Marseille School of Economics, France.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:hal:journl:hal-00798338. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.