The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
AbstractThe Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to share the cost among the nodes (agents). We show that this rule coincides with the folk solution, a very well-known rule of this literature.
Download InfoIf 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.
Bibliographic InfoPaper provided by University Library of Munich, Germany in its series MPRA Paper with number 17839.
Date of creation: 13 Oct 2009
Date of revision:
minimum cost spanning tree; Boruvka's algorithm; folk solution;
Find related papers by JEL classification:
- C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Norde, H.W., 2013. "The Degree and Cost Adjusted Folk Solution for Minimum Cost Spanning Tree Games," Discussion Paper 2013-039, Tilburg University, Center for Economic Research.
- María Gómez-Rúa & Juan Vidal-Puga, 2011. "Merge-proofness in minimum cost spanning tree problems," International Journal of Game Theory, Springer, vol. 40(2), pages 309-329, May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).
If references are entirely missing, you can add them using this form.