IDEAS home Printed from https://ideas.repec.org/p/wpa/wuwpga/0504001.html
   My bibliography  Save this paper

A fair rule in minimum cost spanning tree problems

Author

Listed:
  • Gustavo Bergantiños

    (Universidade de Vigo)

  • Juan Vidal-Puga

    (Universidade de Vigo)

Abstract

We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.

Suggested Citation

  • Gustavo Bergantiños & Juan Vidal-Puga, 2005. "A fair rule in minimum cost spanning tree problems," Game Theory and Information 0504001, EconWPA.
  • Handle: RePEc:wpa:wuwpga:0504001
    Note: Type of Document - pdf; pages: 35
    as

    Download full text from publisher

    File URL: http://econwpa.repec.org/eps/game/papers/0504/0504001.pdf
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Dutta, Bhaskar & Kar, Anirban, 2004. "Cost monotonicity, consistency and minimum cost spanning tree games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 223-248, August.
    2. Gustavo Bergantiños & Leticia Lorenzo, 2004. "A non-cooperative approach to the cost spanning tree problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(3), pages 393-403, July.
    3. 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.
    4. Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004. "The P-value for cost sharing in minimum," Theory and Decision, Springer, vol. 56(1), pages 47-61, April.
    5. Daniel Granot & Michael Maschler, 1998. "Spanning network games," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(4), pages 467-500.
    6. Kar, Anirban, 2002. "Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 265-277, February.
    7. 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.
    8. repec:spr:compst:v:59:y:2004:i:3:p:393-403 is not listed on IDEAS
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    minimum cost spanning tree; cost sharing;

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • D8 - Microeconomics - - Information, Knowledge, and Uncertainty

    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:wpa:wuwpga:0504001. 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: (EconWPA). General contact details of provider: http://econwpa.repec.org .

    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.