IDEAS home Printed from https://ideas.repec.org/p/yor/yorken/11-02.html
   My bibliography  Save this paper

Minimum Cost Spanning Tree Games and Spillover Stability

Author

Listed:
  • Ruud Hendrickx
  • Jacco Thijssen
  • Peter Borm

Abstract

This paper discusses minimum cost spanning tree games and argues that the standard approach of using a transferable utility game to come up with a fair allocation of the total costs has some flaws. A new model of spillover games is presented, in which each agent's decision whether or not to cooperate is properly taken into account.

Suggested Citation

  • Ruud Hendrickx & Jacco Thijssen & Peter Borm, 2011. "Minimum Cost Spanning Tree Games and Spillover Stability," Discussion Papers 11/02, Department of Economics, University of York.
  • Handle: RePEc:yor:yorken:11/02
    as

    Download full text from publisher

    File URL: https://www.york.ac.uk/media/economics/documents/discussionpapers/2011/1102.pdf
    File Function: Main text
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. Ray, Debraj & Vohra, Rajiv, 1999. "A Theory of Endogenous Coalition Structures," Games and Economic Behavior, Elsevier, vol. 26(2), pages 286-336, January.
    3. Bloch, Francis, 1996. "Sequential Formation of Coalitions in Games with Externalities and Fixed Payoff Division," Games and Economic Behavior, Elsevier, vol. 14(1), pages 90-123, May.
    4. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
    5. Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
    6. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    minimum cost spanning tree problems; transferable utility games; spillovers;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:yor:yorken:11/02. 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: (Paul Hodgson). General contact details of provider: http://edirc.repec.org/data/deyoruk.html .

    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.