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

Cost additive rules in minimum cost spanning tree problems with multiple sources

Author

Listed:
  • Bergantiños, Gustavo
  • Lorenzo, Leticia

Abstract

In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple sources called Kruskal sharing rules. This family is characterized with cone wise additivity and independence of irrelevant trees . We also investigate some subsets of this family and provide their axiomatic characterizations. The first subset is obtained by adding core selection. The second one is obtained by adding core selection and equal treatment of source costs

Suggested Citation

  • Bergantiños, Gustavo & Lorenzo, Leticia, 2019. "Cost additive rules in minimum cost spanning tree problems with multiple sources," MPRA Paper 96937, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:96937
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/96937/1/MPRA_paper_96937.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    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. 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.
    5. Rosenthal, Edward C., 1987. "The minimum cost spanning forest game," Economics Letters, Elsevier, vol. 23(4), pages 355-357.
    6. Bergantiños, G. & Navarro-Ramos, A., 2019. "The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources," Mathematical Social Sciences, Elsevier, vol. 99(C), pages 43-48.
    7. 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.
    8. Gouveia, Luis & Leitner, Markus & Ljubić, Ivana, 2014. "Hop constrained Steiner trees with multiple root nodes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 100-112.
    9. 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.
    10. 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.
    11. Brânzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2003. "The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations," Discussion Paper 2003-129, Tilburg University, Center for Economic Research.
    12. L. Gouveia & P. Martins, 1999. "The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel," Annals of Operations Research, Springer, vol. 86(0), pages 271-294, January.
    13. Daniel Granot & Frieda Granot, 1992. "Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 765-780, November.
    14. 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.
    15. 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.
    16. Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004. "The P-value for cost sharing in minimum," Theory and Decision, Springer, vol. 56(1), pages 47-61, April.
    17. 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.
    18. 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.
    19. Gustavo Bergantiños & Leticia Lorenzo & Silvia Lorenzo-Freire, 2010. "The family of cost monotonic and cost additive rules in minimum cost spanning tree problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 34(4), pages 695-710, April.
    20. Kar, Anirban, 2002. "Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 265-277, February.
    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 Bergantinos & Juan D. Moreno-Ternero, 2023. "Anonymity in sharing the revenues from broadcasting sports leagues," Papers 2303.17897, arXiv.org.
    2. Gustavo Bergantiños & Juan D. Moreno-Ternero, 2023. "Broadcasting revenue sharing after cancelling sports competitions," Annals of Operations Research, Springer, vol. 328(2), pages 1213-1238, September.
    3. Bergantiños, Gustavo & Navarro, Adriana, 2019. "Characterization of the painting rule for multi-source minimal cost spanning tree problems," MPRA Paper 93266, University Library of Munich, Germany.

    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. 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. Bergantiños, G. & Navarro-Ramos, A., 2019. "The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources," Mathematical Social Sciences, Elsevier, vol. 99(C), pages 43-48.
    4. 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.
    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. 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.
    7. 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.
    8. 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.
    9. Norde, H.W., 2013. "The Degree and Cost Adjusted Folk Solution for Minimum Cost Spanning Tree Games," Other publications TiSEM 7ac3a323-f736-46a6-b568-c, Tilburg University, School of Economics and Management.
    10. Gustavo Bergantiños & María Gómez-Rúa, 2015. "An axiomatic approach in minimum cost spanning tree problems with groups," Annals of Operations Research, Springer, vol. 225(1), pages 45-63, February.
    11. 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.
    12. Norde, Henk, 2019. "The degree and cost adjusted folk solution for minimum cost spanning tree games," Games and Economic Behavior, Elsevier, vol. 113(C), pages 734-742.
    13. 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.
    14. 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.
    15. Dutta, Bhaskar & Mishra, Debasis, 2012. "Minimum cost arborescences," Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
    16. Gomez-Rua, Maria & Vidal-Puga, Juan, 2006. "No advantageous merging in minimum cost spanning tree problems," MPRA Paper 601, University Library of Munich, Germany.
    17. 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.
    18. Gustavo Bergantiños & Leticia Lorenzo & Silvia Lorenzo-Freire, 2010. "The family of cost monotonic and cost additive rules in minimum cost spanning tree problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 34(4), pages 695-710, April.
    19. 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.
    20. 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.

    More about this item

    Keywords

    minimum cost spanning tree problems; multiple sources; Kruskal sharing rules; axiomatic characterizations.;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:96937. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    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.