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

Commons with increasing marginal costs: random priority versus average cost

Author

Listed:
  • Hervé Crès

    (ECON - Département d'économie (Sciences Po) - Sciences Po - Sciences Po - CNRS - Centre National de la Recherche Scientifique)

  • Hervé Moulin

Abstract

Indivisible units are produced with increasing marginal costs. Under average cost, each user pays average cost. Under random priority, users are randomly ordered (without bias) and successively offered to buy at the true marginal cost. Both average cost (AC) and random priority (RP) inefficiently overproduce. RP tends to overproduce less, but which game collects more surplus depends much on the demand configuration. We show that a key to compare the welfare properties of the two mechanisms is the crowding factor, i.e., the number of potential users over the number of units of output users can afford: The more crowded the commons, the more RP outperforms AC. In the quadratic cost case, beyond the threshold value of 2.4 for the crowding factor, RP strongly outperforms AC; beneath it AC only mildly outperforms RP. Thus the RP mechanism manages crowded commons better than AC.

Suggested Citation

  • Hervé Crès & Hervé Moulin, 2003. "Commons with increasing marginal costs: random priority versus average cost," Post-Print hal-03598176, HAL.
    • Handle: RePEc:hal:journl:hal-03598176
    DOI: 10.1111/1468-2354.t01-1-00102
    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. Moulin, Herve, 2001. "Three Solutions to a Simple Commons Problem," Working Papers 2001-05, Rice University, Department of Economics.
    2. Moulin, Hervé, 2010. "An efficient and almost budget balanced cost sharing method," Games and Economic Behavior, Elsevier, vol. 70(1), pages 107-131, September.
    3. Bloch, Francis, 2017. "Second-best mechanisms in queuing problems without transfers:The role of random priorities," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 73-79.
    4. Hervé Moulin, 2008. "The price of anarchy of serial, average and incremental cost sharing," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 36(3), pages 379-405, September.

    More about this item

    JEL classification:

    • D60 - Microeconomics - - Welfare Economics - - - General

    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-03598176. 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.