IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v24y2004i1p21-33.html
   My bibliography  Save this article

Allocating the Cost of Congestion with the Nucleolus

Author

Listed:
  • Gilles Reinhardt

Abstract

A natural approach to solve resource sharing problems is to model them as cooperative games and use the results to allocate the costs of the shared resource. The nucleolus, a solution concept derived from cooperative game theory, requires an exponential number of computations since the solution must adhere to individual and coalitional rationality conditions. Littlechild (1974) provides a linear algorithm which produces the nucleolus of a cost allocation game when the cost of a coalition is the cost of the largest player in that coalition. In this paper, we show that for a large class of congestion cost allocation games, where each player has an independent impact on the shared resource, we can nonetheless bypass all the computational complexity and derive allocations in closed form.

Suggested Citation

  • Gilles Reinhardt, 2004. "Allocating the Cost of Congestion with the Nucleolus," Computational Economics, Springer;Society for Computational Economics, vol. 24(1), pages 21-33, August.
    • Handle: RePEc:kap:compec:v:24:y:2004:i:1:p:21-33
    as

    Download full text from publisher

    File URL: http://journals.kluweronline.com/issn/0927-7099/contents
    Download Restriction: Access to the full text of the articles in this series is restricted.
    ---><---

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

    More about this item

    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:kap:compec:v:24:y:2004:i:1:p:21-33. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.