This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Additivity in cost spanning tree problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Gustavo Bergantiños (Universidade de Vigo)
Juan Vidal-Puga (Universidade de Vigo)

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

Abstract

We characterize a rule in cost spanning tree problems using an additivity property and some basic properties. If the set of possible agents has at least three agents, these basic properties are symmetry and separability. If the set of possible agents has two agents, we must add positivity. In both characterizations we can replace separability by population monotonicity.

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 page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://129.3.20.41/eps/game/papers/0405/0405001.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by EconWPA in its series Game Theory and Information with number 0405001.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 22 pages
Date of creation: 04 May 2004
Date of revision:
Handle: RePEc:wpa:wuwpga:0405001

Note: Type of Document - pdf; pages: 22
Contact details of provider:
Web page: http://129.3.20.41

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

Related research
Keywords: cost spanning tree problems additivity characterization;

Other versions of this item:

Find related papers by JEL classification:
C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General

This paper has been announced in the following NEP Reports:

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.:
  1. Moulin Herve & Shenker Scott, 1994. "Average Cost Pricing versus Serial Cost Sharing: An Axiomatic Comparison," Journal of Economic Theory, Elsevier, vol. 64(1), pages 178-201, October. [Downloadable!] (restricted)
  2. Branzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2003. "The p-value for cost sharing in minimum cost spanning tree situations," Discussion Paper 129, Tilburg University, Center for Economic Research. [Downloadable!]
  3. 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:
  4. 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!]
  5. Bergantinos, Gustavo & Vidal-Puga, Juan J., 2004. "Additive rules in bankruptcy problems and other related problems," Mathematical Social Sciences, Elsevier, vol. 47(1), pages 87-101, January. [Downloadable!] (restricted)
    Other versions:
  6. 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:
  7. Daniel Granot & Michael Maschler, 1998. "Spanning network games," International Journal of Game Theory, Springer, vol. 27(4), pages 467-500. [Downloadable!] (restricted)
Full references

Cited by:
(explanations, 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.)

  1. 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:
  2. Gustavo Bergantinos & Juan Vidal-Puga, 2008. "On Some Properties of Cost Allocation Rules in Minimum Cost Spanning Tree Problems," AUCO Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 2(3), pages 251-267, December. [Downloadable!]
Statistics
Access and download statistics

Did you know? You can use IDEAS to provide links to papers and articles in your course syllabus.

This page was last updated on 2009-12-2.

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.