IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/56ea8c64-a05f-4b3f-ab61-9096e213f109.html
   My bibliography  Save this paper

On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems

Author

Listed:
  • Feltkamp, V.
  • Tijs, S.H.

    (Tilburg University, Center For Economic Research)

  • Muto, S.

Abstract

Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces an algorithm generating all elements of the irreducible core. Moreover, the equal remaining obligations rule, a one-point refinement of the irreducible core ispresented. Finally, the paper characterizes these solutions axiomatically. The classical Bird tree allocation of minimum cost spanning tree problems is obtained as a particular case in our algorithm for the irreducible core.

Suggested Citation

  • Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems," Discussion Paper 1994-106, Tilburg University, Center for Economic Research.
  • Handle: RePEc:tiu:tiucen:56ea8c64-a05f-4b3f-ab61-9096e213f109
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/portal/files/520178/106.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "Minimum cost spanning extension problems : The proportional rule and the decentralized rule," Discussion Paper 1994-96, Tilburg University, Center for Economic Research.
    2. Kuipers, Jeroen, 1993. "On the Core of Information Graph Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(4), pages 339-350.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Networks; Cost Allocation; costs and cost price;

    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:tiu:tiucen:56ea8c64-a05f-4b3f-ab61-9096e213f109. 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: (Richard Broekman). General contact details of provider: http://center.uvt.nl .

    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.