IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-28258-7_19.html
   My bibliography  Save this book chapter

The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects

In: Recent Advances in Optimization

Author

Listed:
  • Stef Tijs

    (University of Genoa
    Tilburg University)

  • Stefano Moretti

    (University of Genoa
    National Cancer Research Institute of Genoa)

  • Rodica Branzei

    (“Alexandru Ioan Cuza” University)

  • Henk Norde

    (Tilburg University)

Abstract

Summary A new way is presented to define for minimum cost spanning tree (mcst) games the irreducible core, which is introduced by Bird in 1976. The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for mcst-problems is a selection of the Bird core correspondence. Using the additivity property an axiomatic characterization of the Bird core correspondence is obtained.

Suggested Citation

  • Stef Tijs & Stefano Moretti & Rodica Branzei & Henk Norde, 2006. "The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects," Lecture Notes in Economics and Mathematical Systems, in: Alberto Seeger (ed.), Recent Advances in Optimization, pages 305-322, Springer.
    • Handle: RePEc:spr:lnechp:978-3-540-28258-7_19
    DOI: 10.1007/3-540-28258-0_19
    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 search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    2. Anna Bogomolnaia & Ron Holzman & Hervé Moulin, 2010. "Sharing the Cost of a Capacity Network," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 173-192, February.
    3. Bogomolnaia, Anna & Moulin, Hervé, 2010. "Sharing a minimal cost spanning tree: Beyond the Folk solution," Games and Economic Behavior, Elsevier, vol. 69(2), pages 238-248, July.
    4. Davila-Pena, Laura & Borm, Peter & Garcia-Jurado, Ignacio & Schouten, Jop, 2023. "An Allocation Rule for Graph Machine Scheduling Problems," Other publications TiSEM 17013f33-1d65-4294-802c-b, Tilburg University, School of Economics and Management.
    5. Davila-Pena, Laura & Borm, Peter & Garcia-Jurado, Ignacio & Schouten, Jop, 2023. "An Allocation Rule for Graph Machine Scheduling Problems," Discussion Paper 2023-009, Tilburg University, Center for Economic Research.
    6. María Gómez-Rúa & Juan Vidal-Puga, 2017. "A monotonic and merge-proof rule in minimum cost spanning tree situations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 813-826, March.

    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:spr:lnechp:978-3-540-28258-7_19. 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.