IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this paper

A fair rule in minimum cost spanning tree problems

  • Gustavo Bergantiños

    (Universidade de Vigo)

  • Juan Vidal-Puga

    (Universidade de Vigo)

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.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

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

Paper provided by EconWPA in its series Game Theory and Information with number 0504001.

as
in new window

Length: 35 pages
Date of creation: 04 Apr 2005
Date of revision:
Handle: RePEc:wpa:wuwpga:0504001
Note: Type of Document - pdf; pages: 35
Contact details of provider: Web page: http://econwpa.repec.org

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

as in new window
  1. Dutta, Bhaskar & Kar, Anirban, 2002. "Cost Monotonicity, Consistency And Minimum Cost Spanning Tree Games," The Warwick Economics Research Paper Series (TWERPS) 629, University of Warwick, Department of Economics.
  2. 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, 04.
  3. Daniel Granot & Michael Maschler, 1998. "Spanning network games," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(4), pages 467-500.
  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. repec:spr:compst:v:59:y:2004:i:3:p:393-403 is not listed on IDEAS
  6. 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.
  7. 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, 07.
  8. 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.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

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)

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.