IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v38y2009i1p107-126.html
   My bibliography  Save this article

A characterization of Kruskal sharing rules for minimum cost spanning tree problems

Author

Listed:
  • Leticia Lorenzo
  • Silvia Lorenzo-Freire

Abstract

No abstract is available for this item.

Suggested Citation

  • Leticia Lorenzo & Silvia Lorenzo-Freire, 2009. "A characterization of Kruskal sharing rules for minimum cost spanning tree problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(1), pages 107-126, March.
    • Handle: RePEc:spr:jogath:v:38:y:2009:i:1:p:107-126
    DOI: 10.1007/s00182-008-0147-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00182-008-0147-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00182-008-0147-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gustavo Bergantiños & Leticia Lorenzo, 2004. "A non-cooperative approach to the cost spanning tree problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(3), pages 393-403, July.
    2. Maurice Salles, 2016. "Social choice," Chapters, in: Gilbert Faccarello & Heinz D. Kurz (ed.), Handbook on the History of Economic Analysis Volume III, chapter 36, pages 518-537, Edward Elgar Publishing.
    3. Norde, Henk & Moretti, Stefano & Tijs, Stef, 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 154(1), pages 84-97, April.
    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," Other publications TiSEM 56ea8c64-a05f-4b3f-ab61-9, Tilburg University, School of Economics and Management.
    5. Ehud Kalai & Dov Samet, 1983. "On Weighted Shapley Values," Discussion Papers 602, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    6. 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.
    7. 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.
    8. Dutta, Bhaskar & Kar, Anirban, 2004. "Cost monotonicity, consistency and minimum cost spanning tree games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 223-248, August.
    9. Barnett,William A. & Moulin,Hervé & Salles,Maurice & Schofield,Norman J. (ed.), 1995. "Social Choice, Welfare, and Ethics," Cambridge Books, Cambridge University Press, number 9780521443401, September.
    10. Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "Minimum cost spanning extension problems : The proportional rule and the decentralized rule," Other publications TiSEM 2c6cd46b-7e72-4262-a479-3, Tilburg University, School of Economics and Management.
    11. Tijs, Stef & Branzei, Rodica & Moretti, Stefano & Norde, Henk, 2006. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," European Journal of Operational Research, Elsevier, vol. 175(1), pages 121-134, November.
    12. Gustavo Bergantiños & Juan Vidal-Puga, 2007. "The optimistic TU game in minimum cost spanning tree problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(2), pages 223-239, October.
    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. Gustavo Bergantiños & Leticia Lorenzo, 2021. "Cost additive rules in minimum cost spanning tree problems with multiple sources," Annals of Operations Research, Springer, vol. 301(1), pages 5-15, June.
    2. Gustavo Bergantiños & Youngsub Chun & Eunju Lee & Leticia Lorenzo, 2022. "The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 24(01), pages 1-36, March.
    3. Christian Trudeau, 2023. "Minimum cost spanning tree problems as value sharing problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 253-272, March.
    4. Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    5. María Gómez-Rúa & Juan Vidal-Puga, 2017. "A monotonic and merge-proof rule in minimum cost spanning tree situations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 813-826, March.
    6. Jun Long & Xianghui Yuan & Liwei Jin & Chencheng Zhao, 2024. "Connectedness and risk spillover in China's commodity futures sectors," Journal of Futures Markets, John Wiley & Sons, Ltd., vol. 44(5), pages 784-802, May.
    7. Gustavo Bergantiños & Juan Vidal-Puga, 2015. "Characterization of monotonic rules in minimum cost spanning tree problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 835-868, November.
    8. Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.
    9. Bergantiños, Gustavo & Lorenzo, Leticia & Lorenzo-Freire, Silvia, 2011. "A generalization of obligation rules for minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 211(1), pages 122-129, May.
    10. Bergantiños, Gustavo & Kar, Anirban, 2010. "On obligation rules for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 69(2), pages 224-237, July.
    11. Chun, Youngsub & Lee, Joosung, 2012. "Sequential contributions rules for minimum cost spanning tree problems," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 136-143.
    12. Darko Skorin-Kapov, 2018. "Social enterprise tree network games," Annals of Operations Research, Springer, vol. 268(1), pages 5-20, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    2. Dutta, Bhaskar & Mishra, Debasis, 2012. "Minimum cost arborescences," Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
    3. María Gómez-Rúa & Juan Vidal-Puga, 2017. "A monotonic and merge-proof rule in minimum cost spanning tree situations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 813-826, March.
    4. Hernández, Penélope & Peris, Josep E. & Vidal-Puga, Juan, 2023. "A non-cooperative approach to the folk rule in minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 922-928.
    5. Bergantinos, Gustavo & Lorenzo-Freire, Silvia, 2008. ""Optimistic" weighted Shapley rules in minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 185(1), pages 289-298, February.
    6. Christian Trudeau, 2023. "Minimum cost spanning tree problems as value sharing problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 253-272, March.
    7. Moulin, Hervé, 2014. "Pricing traffic in a spanning network," Games and Economic Behavior, Elsevier, vol. 86(C), pages 475-490.
    8. Jens Hougaard & Hervé Moulin & Lars Østerdal, 2010. "Decentralized pricing in minimum cost spanning trees," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 44(2), pages 293-306, August.
    9. Bogomolnaia, Anna & Moulin, Hervé, 2010. "Sharing a minimal cost spanning tree: Beyond the Folk solution," Games and Economic Behavior, Elsevier, vol. 69(2), pages 238-248, July.
    10. Gomez-Rua, Maria & Vidal-Puga, Juan, 2006. "No advantageous merging in minimum cost spanning tree problems," MPRA Paper 601, University Library of Munich, Germany.
    11. Hougaard, Jens Leth & Tvede, Mich, 2012. "Truth-telling and Nash equilibria in minimum cost spanning tree models," European Journal of Operational Research, Elsevier, vol. 222(3), pages 566-570.
    12. José-Manuel Giménez-Gómez & Josep E Peris & Begoña Subiza, 2020. "An egalitarian approach for sharing the cost of a spanning tree," PLOS ONE, Public Library of Science, vol. 15(7), pages 1-14, July.
    13. Bergantiños, G. & Gómez-Rúa, M. & Llorca, N. & Pulido, M. & Sánchez-Soriano, J., 2014. "A new rule for source connection problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 780-788.
    14. Bergantiños, Gustavo & Kar, Anirban, 2010. "On obligation rules for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 69(2), pages 224-237, July.
    15. Hernández, Penélope & Peris, Josep E. & Silva-Reus, José A., 2016. "Strategic sharing of a costly network," Journal of Mathematical Economics, Elsevier, vol. 66(C), pages 72-82.
    16. Gustavo Bergantiños & María Gómez-Rúa, 2010. "Minimum cost spanning tree problems with groups," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 43(2), pages 227-262, May.
    17. Bergantiños, Gustavo & Vidal-Puga, Juan, 2009. "Additivity in minimum cost spanning tree problems," Journal of Mathematical Economics, Elsevier, vol. 45(1-2), pages 38-42, January.
    18. Kusunoki, Yoshifumi & Tanino, Tetsuzo, 2017. "Investigation on irreducible cost vectors in minimum cost arborescence problems," European Journal of Operational Research, Elsevier, vol. 261(1), pages 214-221.
    19. Bergantiños, Gustavo & Lorenzo, Leticia & Lorenzo-Freire, Silvia, 2011. "A generalization of obligation rules for minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 211(1), pages 122-129, May.
    20. Trudeau, Christian, 2012. "A new stable and more responsive cost sharing solution for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 75(1), pages 402-412.

    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:spr:jogath:v:38:y:2009:i:1:p:107-126. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.