No advantageous merging in minimum cost spanning tree problems

This file is part of IDEAS, which uses RePEc data

No advantageous merging in minimum cost spanning tree problems

Author Info

Gomez-Rua, Maria
Vidal-Puga, Juan

Additional information is available for the following registered author(s):

Juan Vidal-Puga

Abstract

In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called No Advantageous Merging. This property implies that no group of agents can be better off claiming to be a single node. We show that the sharing rule that assigns to each agent his own connection cost (the Bird rule) satisfies this property. Moreover, we provide a characterization of the Bird rule using No Advantageous Merging.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

Publisher Info
Paper provided by University Library of Munich, Germany in its series MPRA Paper with number 601.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: 24 Oct 2006
Date of revision:
Handle: RePEc:pra:mprapa:601

Contact details of provider:
Postal: Schackstr. 4, D-80539 Munich, Germany
Phone: +49-(0)89-2180-2219
Fax: +49-(0)89-2180-3900
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Ekkehart Schlicht).

Find related papers by JEL classification:
D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
D7 - Microeconomics - - Analysis of Collective Decision-Making

This paper has been announced in the following NEP Reports:

NEP-ALL-2006-11-12 (All new papers)
NEP-GTH-2006-11-12 (Game Theory)

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.:

Tijs, S.H. & Branzei, R. & Moretti, S. & Norde, H.W., 2004. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," Discussion Paper 53, Tilburg University, Center for Economic Research. [Downloadable!]
Other versions:
- 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. [Downloadable!] (restricted)
Feltkamp, V. & Tijs, S. & Muto, S., 1994. "On the Irreducible Core and the Equal Remaining Obligations Rule of Minimum Cost Spanning Extension Problems," Discussion Paper 106, Tilburg University, Center for Economic Research. [Downloadable!]
Gustavo Bergantiños & Juan Vidal-Puga, 2005. "A fair rule in minimum cost spanning tree problems," Game Theory and Information 0504001, EconWPA. [Downloadable!]
Other versions:
- Bergantinos, Gustavo & Vidal-Puga, Juan J., 2007. "A fair rule in minimum cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 326-352, November. [Downloadable!] (restricted)
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. [Downloadable!] (restricted)
Norde, Henk & Moretti, Stefano & Tijs, Stef, 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 154(1), pages 84-97, April. [Downloadable!] (restricted)
Other versions:
- Norde, H. & Moretti, S. & Tijs, S., 2001. "Minimum cost spanning tree games and population monotonic allocation schemes," Discussion Paper 18, Tilburg University, Center for Economic Research. [Downloadable!]
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. [Downloadable!] (restricted)
Other versions:
- Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004. "The P-value for cost sharing in minimum," Theory and Decision, Springer, vol. 56(2_2), pages 47-61, 02. [Downloadable!]
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. [Downloadable!] (restricted)
Other versions:
- Bhaskar Dutta & Anirban Kar, 2002. "Cost monotonicity, consistency and minimum cost spanning tree games," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 02-04, Indian Statistical Institute, New Delhi, India. [Downloadable!]
- 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. [Downloadable!]
Gustavo Bergantiños & Juan Vidal-Puga, 2007. "The optimistic TU game in minimum cost spanning tree problems," International Journal of Game Theory, Springer, vol. 36(2), pages 223-239, October. [Downloadable!] (restricted)

Full references

Statistics
Access and download statistics

Did you know? All the bibliographic data shown here has been contributed by volunteers, thereby helping to keep this service free.

This page was last updated on 2008-11-17.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.