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! ]

On the Shapley value of a minimum cost spanning tree problem

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 associate an optimistic coalitional game with each minimum cost spanning tree problem. We define the worth of a coalition as the cost of connection assuming that the rest of the agents are already connected. We define a cost sharing rule as the Shapley value of this optimistic game. We prove that this rule coincides with a rule present in the literature under different names. We also introduce a new characterization using a property of equal contributions.

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/0509/0509001.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 0509001.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 17 pages
Date of creation: 01 Sep 2005
Date of revision:
Handle: RePEc:wpa:wuwpga:0509001

Note: Type of Document - pdf; pages: 17
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: minimum cost spanning tree problems Shapley value;

Other versions of this item:

Find related papers by JEL classification:
C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

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. 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:
  2. 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!]
Full references

Statistics
Access and download statistics

Did you know? IDEAS is not the only service displaying RePEc data. Choose on RePEc which service fits your needs best.

This page was last updated on 2009-11-5.

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.