IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/bcaf99d7-5b94-437f-a89c-dc0dc9f9a09b.html
   My bibliography  Save this paper

Minimum cost spanning tree games and population monotonic allocation schemes

Author

Listed:
  • Norde, H.W.

    (Tilburg University, School of Economics and Management)

  • Moretti, S.
  • Tijs, S.H.

    (Tilburg University, School of Economics and Management)

Abstract

In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegative combination of minimum cost spanning tree games corresponding to 0-1 cost functions.It turns out that the Subtraction Algorithm is closely related to the famous algorithm of Kruskal for the determination of minimum cost spanning trees.For variants of the classical minimum cost spanning tree games we show that population monotonic allocation schemes do not necessarily exist.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Norde, H.W. & Moretti, S. & Tijs, S.H., 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," Other publications TiSEM bcaf99d7-5b94-437f-a89c-d, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:bcaf99d7-5b94-437f-a89c-dc0dc9f9a09b
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/565262/27660_19783.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Stefano Moretti & Henk Norde & Kim Pham Do & Stef Tijs, 2002. "Connection problems in mountains and monotonic allocation schemes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(1), pages 83-99, June.
    2. Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tijs, S.H. & Brânzei, R. & Moretti, S. & Norde, H.W., 2004. "Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties," Other publications TiSEM 78d24994-1074-4329-b911-c, Tilburg University, School of Economics and Management.
    2. Norde, H.W. & Moretti, S. & Tijs, S.H., 2001. "Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes," Other publications TiSEM 794e124d-6be4-494d-a14f-4, Tilburg University, School of Economics and Management.
    3. Tijs, S.H. & Moretti, S. & Brânzei, R. & Norde, H.W., 2005. "The Bird Core for Minimum Cost Spanning Tree problems Revisited : Monotonicity and Additivity Aspects," Discussion Paper 2005-3, Tilburg University, Center for Economic Research.
    4. Brânzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2003. "The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations," Discussion Paper 2003-129, Tilburg University, Center for Economic Research.
    5. Tijs, S.H. & Moretti, S. & Brânzei, R. & Norde, H.W., 2005. "The Bird Core for Minimum Cost Spanning Tree problems Revisited : Monotonicity and Additivity Aspects," Other publications TiSEM 530f2c60-024d-4f3e-b724-1, Tilburg University, School of Economics and Management.
    6. Brânzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2003. "The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations," Other publications TiSEM de0e437c-1588-469d-a2ff-a, Tilburg University, School of Economics and Management.
    7. Stefano Moretti & Henk Norde, 2022. "Some new results on generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 87-118, March.
    8. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    9. Tijs, Stef & Branzei, Rodica & Moretti, Stefano & Norde, Henk, 2006. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," European Journal of Operational Research, Elsevier, vol. 175(1), pages 121-134, November.
    10. Antonio Magaña & Francesc Carreras, 2018. "Coalition Formation and Stability," Group Decision and Negotiation, Springer, vol. 27(3), pages 467-502, June.
    11. Dall'Aglio, M. & Brânzei, R. & Tijs, S.H., 2008. "Cooperation in Dividing the Cake," Discussion Paper 2008-101, Tilburg University, Center for Economic Research.
    12. Cristina Fernández & Peter Borm & Ruud Hendrickx & Stef Tijs, 2005. "Drop out monotonic rules for sequencing situations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(3), pages 501-504, July.
    13. Brânzei, R. & Dimitrov, D.A. & Tijs, S.H., 2002. "Convex Fuzzy Games and Participation Monotonic Allocation Schemes," Discussion Paper 2002-13, Tilburg University, Center for Economic Research.
    14. van den Brink, René & Núñez, Marina & Robles, Francisco, 2021. "Valuation monotonicity, fairness and stability in assignment problems," Journal of Economic Theory, Elsevier, vol. 195(C).
    15. Ehlers, Lars, 2003. "Multiple public goods, lexicographic preferences, and single-plateaued preference rules," Games and Economic Behavior, Elsevier, vol. 43(1), pages 1-27, April.
    16. Rodica Branzei & Dinko Dimitrov & Stef Tijs, 2008. "Convex Games Versus Clan Games," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 10(04), pages 363-372.
    17. Casajus, André & Huettner, Frank, 2014. "Weakly monotonic solutions for cooperative games," Journal of Economic Theory, Elsevier, vol. 154(C), pages 162-172.
    18. Németh, Tibor & Pintér, Miklós, 2017. "The non-emptiness of the weak sequential core of a transferable utility game with uncertainty," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 1-6.
    19. Frank Karsten & Marco Slikker & Geert‐Jan van Houtum, 2012. "Inventory pooling games for expensive, low‐demand spare parts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(5), pages 311-324, August.
    20. Grahn-Voorneveld, Sofia, 2011. "Sharing profit in parallel and serial transport networks," Working papers in Transport Economics 2011:7, CTS - Centre for Transport Studies Stockholm (KTH and VTI).

    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:tiu:tiutis:bcaf99d7-5b94-437f-a89c-dc0dc9f9a09b. 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.

    If CitEc recognized a bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.