IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/17839.html
   My bibliography  Save this paper

The folk solution and Boruvka's algorithm in minimum cost spanning tree problems

Author

Listed:
  • Bergantiños, Gustavo
  • Vidal-Puga, Juan

Abstract

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

Suggested Citation

  • Bergantiños, Gustavo & Vidal-Puga, Juan, 2009. "The folk solution and Boruvka's algorithm in minimum cost spanning tree problems," MPRA Paper 17839, University Library of Munich, Germany.
  • Handle: RePEc:pra:mprapa:17839
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/17839/1/MPRA_paper_17839.pdf
    File Function: original version
    Download Restriction: no

    References listed on IDEAS

    as
    1. Walkenhorst, Peter, 2006. "Compensating Lost Revenue in Regional Trade Agreements," MPRA Paper 12279, University Library of Munich, Germany.
    2. Yongzheng Yang & Sanjeev Gupta, 2005. "Regional Trade Arrangements in Africa; Past Performance and the Way Forward," IMF Working Papers 05/36, International Monetary Fund.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. María Gómez-Rúa & Juan Vidal-Puga, 2011. "Merge-proofness in minimum cost spanning tree problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 309-329, May.

    More about this item

    Keywords

    minimum cost spanning tree; Boruvka's algorithm; folk solution;

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:17839. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter). General contact details of provider: http://edirc.repec.org/data/vfmunde.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.