Ciftci, B.B. Tijs, S.H. (Tilburg University, Center for Economic Research)
Abstract
In this paper we consider spanning tree problems, where n players want to be connected to a source as cheap as possible. We introduce and analyze (n!) vertex oriented construct and charge procedures for such spanning tree situations leading in n steps to a minimum cost spanning tree and a cost sharing where each player pays the edge which he chooses in the procedure. The main result of the paper is that the average of the n! cost sharings provided by our procedure is equal to the P-value for minimum cost spanning tree situations introduced and characterized by Branzei et al. (2004). As a side product, we find a new method, the vertex oriented procedure, to construct minimum cost spanning trees.
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.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
2007-89.
For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).
Related research
Keywords:
Other versions of this item:
Find related papers by JEL classification: C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games D72 - Microeconomics - - Analysis of Collective Decision-Making - - - Models of Political Processes: Rent-seeking, Elections, Legislatures, and Voting Behavior
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.: