IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this paper

Folk solution for simple minimum cost spanning tree problems

Listed author(s):
  • Subiza, Begoña

    ()

    (Universidad de Alicante, Departamento de Métodos Cuantitativos y Teoría Económica)

  • Giménez, José Manuel

    ()

    (Universitat Rovira i Virgili, Departament d'Economia and CREIP)

  • Peris, Josep E.

    ()

    (Universidad de Alicante, Departamento de Métodos Cuantitativos y Teoría Económica)

A minimum cost spanning tree problem analyzes how to efficiently connect a group of individuals to a source. Once the efficient tree is obtained, the addressed question is how to allocate the total cost among the involved agents. One prominent solution in allocating this minimum cost is the so-called Folk solution. Unfortunately, in general, the Folk solution is not easy to compute. We identify a class of mcst problems in which the Folk solution is obtained in an easy way.

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

File URL: http://web.ua.es/es/dmcte/documentos/qmetwp1507.pdf
File Function: Full text
Download Restriction: no

Paper provided by University of Alicante, D. Quantitative Methods and Economic Theory in its series QM&ET Working Papers with number 15-7.

as
in new window

Length: 12 pages
Date of creation: 03 Nov 2015
Handle: RePEc:ris:qmetal:2015_007
Contact details of provider: Postal:
+34 965 90 36 70

Phone: +34 965 90 36 70
Fax: +34 965 90 97 89
Web page: http://web.ua.es/es/dmcte
Email:


More information through EDIRC

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

as
in new window


  1. Bergantinos, Gustavo & Vidal-Puga, Juan J., 2007. "A fair rule in minimum cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 326-352, November.
  2. Estévez-Fernández, Arantza & Reijnierse, Hans, 2014. "On the core of cost-revenue games: Minimum cost spanning tree games with revenues," European Journal of Operational Research, Elsevier, vol. 237(2), pages 606-616.
  3. Gustavo Bergantinos & Juan Vidal-Puga, 2008. "On Some Properties of Cost Allocation Rules in Minimum Cost Spanning Tree Problems," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 2(3), pages 251-267, December.
  4. Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems," Discussion Paper 1994-106, Tilburg University, Center for Economic Research.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:ris:qmetal:2015_007. 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: (Julio Carmona)

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.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.