Skip to main content
SpringerLink
Log in

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

  • S.I.: SING 14
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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 by cone-wise additivity and independence of irrelevant trees. We also investigate some subsets of this family and provide axiomatic characterizations of them. The first subset is obtained by adding core selection. The second is obtained by adding core selection and equal treatment of source costs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. This paper has been significantly shortened from it original version and so only the ideas behind the different steps of the proofs are given in the text. Besides, the independence of the properties for all the characterization results has been omitted. For further information please contact us by email.

References

  • Bergantiños, G., Chun, Y., Lee, E., Lorenzo, L. (2018). The folk rule for minimum cost spanning tree problems with multiple sources. Working paper.

  • Bergantiños, G., & Gómez-Rúa, M. (2015). An axiomatic approach in minimum cost spanning tree problems with groups. Annals of Operations Research, 225, 45–63.

    Article  Google Scholar 

  • 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, 234(3), 780–788.

    Article  Google Scholar 

  • Bergantiños, G., & Kar, A. (2010). On obligation rules for minimum cost spanning tree problems. Games and Economic Behavior, 69, 224–237.

    Article  Google Scholar 

  • Bergantiños, G., Lorenzo, L., & Lorenzo-Freire, S. (2010). The family of cost monotonic and cost additive rules in minimum cost spanning tree problems. Social Choice and Welfare, 34, 695–710.

    Article  Google Scholar 

  • Bergantiños, G., Lorenzo, L., & Lorenzo-Freire, S. (2011). A generalization of obligation rules for minimum cost spanning tree problems. European Journal of Operational Research, 211, 122–129.

    Article  Google Scholar 

  • Bergantiños, G., & Navarro-Ramos, A. (2019a). The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources. Mathematical Social Sciences, 99, 43–48.

    Article  Google Scholar 

  • Bergantiños, G., & Navarro-Ramos, A. (2019b). A characterization of the folk rule for multi-source minimal cost spanning tree problems. Operations Research Letters, 47, 366–370.

    Article  Google Scholar 

  • Bergantiños, G., & Vidal-Puga, J. J. (2009). Additivity in minimum cost spanning tree problems. Journal of Mathematical Economics, 45, 38–42.

    Article  Google Scholar 

  • Bergantiños, G., & Vidal-Puga, J. J. (2007). A fair rule in minimum cost spanning tree problems. Journal of Economic Theory, 137, 326–352.

    Article  Google Scholar 

  • Bird, C. G. (1976). On cost allocation for a spanning tree: A game theoretic approach. Networks, 6, 335–350.

    Article  Google Scholar 

  • Bogomolnaia, A., & Moulin, H. (2010). Sharing a minimal cost spanning tree: Beyond the Folk solution. Games and Economic Behavior, 69, 238–248.

    Article  Google Scholar 

  • Branzei, R., Moretti, S., Norde, H., & Tijs, S. (2004). The P-value for cost sharing in minimum cost spanning tree situations. Theory and Decision, 56, 47–61.

    Article  Google Scholar 

  • Dutta, B., & Kar, A. (2004). Cost monotonicity, consistency and minimum cost spanning tree games. Games and Economic Behavior, 48, 223–248.

    Article  Google Scholar 

  • Farley, A. M., Fragopoulou, P., Krumme, D. W., Proskurowski, A., & Richards, D. (2000). Multi-source spanning tree problems. Journal of Interconnection Networks, 1, 61–71.

    Article  Google Scholar 

  • Gouveia, L., Leitner, M., & Ljubic, I. (2014). Hop constrained Steiner trees with multiple root nodes. European Journal of Operational Research, 236, 100–112.

    Article  Google Scholar 

  • Gouveia, L., & Martins, P. (1999). The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexed model. Annals of Operations Research, 86, 271–294.

    Article  Google Scholar 

  • Granot, D., & Granot, F. (1992). Computational Complexity of a cost allocation approach to a fixed cost forest problem. Mathematics of Operations Research, 17(4), 765–780.

    Article  Google Scholar 

  • Kar, A. (2002). Axiomatization of the Shapley value on minimum cost spanning tree problems. Games and Behavior, 38, 265–277.

    Article  Google Scholar 

  • Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7, 48–50.

    Article  Google Scholar 

  • Kuipers, J. (1997). Minimum cost forest games. International Journal of Game Theory, 26(3), 367–377.

    Article  Google Scholar 

  • Lorenzo, L., & Lorenzo-Freire, S. (2009). A characterization of obligation rules for minimum cost spanning tree problems. International Journal of Game Theory, 38, 107–126.

    Article  Google Scholar 

  • Norde, H., Moretti, S., & Tijs, S. (2004). Minimum cost spanning tree games and population monotonic allocation schemes. European Journal of Operational Research, 154, 84–97.

    Article  Google Scholar 

  • Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell Systems Technology Journal, 36, 1389–1401.

    Article  Google Scholar 

  • Rosenthal, E. C. (1987). The minimum cost spanning forest game. Economic Letters, 23(4), 355–357.

    Article  Google Scholar 

  • Tijs, S., Branzei, R., Moretti, S., & Norde, H. (2006). Obligation rules for minimum cost spanning tree situations and their monotonicity properties. European Journal of Operational Research, 175, 121–134.

    Article  Google Scholar 

  • Trudeau, C. (2012). A new stable and more responsive cost sharing solution for minimum cost spanning tree problems. Games and Behavior, 75, 402–412.

    Article  Google Scholar 

Download references

Acknowledgements

Bergantiños and Lorenzo are partially supported by research Grants GRC 2015/014 and ED431B 2019/34 from “Xunta de Galicia” and ECO2017-82241-R from the Spanish Ministry of Economy, Industry and Competitiveness. We thank Youngsub Chun and Eunju Lee for their valuable comments on this paper.

Author information

Authors and Affiliations

  1. Economics, Society and Territory, Universidade de Vigo, 36310, Vigo, Spain

    Gustavo Bergantiños & Leticia Lorenzo

Authors
  1. Gustavo Bergantiños
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leticia Lorenzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leticia Lorenzo.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bergantiños, G., Lorenzo, L. Cost additive rules in minimum cost spanning tree problems with multiple sources. Ann Oper Res 301, 5–15 (2021). https://doi.org/10.1007/s10479-020-03868-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-020-03868-2

Keywords

Search

Navigation