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

Cooperative games for minimum cost spanning tree problems

Author

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

Abstract

Minimum cost spanning tree problems are well known problems in the Operations Research literature. Some agents, located at different geographical places, want a service provided by a common supplier. Agents will be served through costly connections. Some part of the literature has focused, mainly, in studying how to allocate the connection cost among the agents. We review the papers that have addressed the allocation problem using cooperative game theory.

Suggested Citation

  • Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:104911
    as

    Download full text from publisher

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

    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. Gustavo Bergantiños & Silvia Lorenzo-Freire, 2008. "A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 35(3), pages 523-538, June.
    4. 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.
    5. 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.
    6. Juan J. Vidal-Puga, 2004. "Bargaining with commitments," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(1), pages 129-144, January.
    7. Chun, Youngsub & Lee, Joosung, 2012. "Sequential contributions rules for minimum cost spanning tree problems," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 136-143.
    8. 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.
    9. Ginsburgh, Victor & Zang, Israel, 2003. "The museum pass game and its value," Games and Economic Behavior, Elsevier, vol. 43(2), pages 322-325, May.
    10. Trudeau, Christian & Vidal-Puga, Juan, 2020. "Clique games: A family of games with coincidence between the nucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 8-14.
    11. 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.
    12. Subiza, Begoña & Giménez, José Manuel & Peris, Josep E., 2015. "Folk solution for simple minimum cost spanning tree problems," QM&ET Working Papers 15-7, University of Alicante, D. Quantitative Methods and Economic Theory.
    13. Christian Trudeau, 2013. "Characterizations Of The Kar And Folk Solutions For Minimum Cost Spanning Tree Problems," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(02), pages 1-16.
    14. Christian Trudeau, 2014. "Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 941-957, April.
    15. 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.
    16. Núñez, Marina & Vidal-Puga, Juan, 2022. "Stable cores in information graph games," Games and Economic Behavior, Elsevier, vol. 132(C), pages 353-367.
    17. Pham Do, K.H. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2002. "Connection problems in mountains and monotonic cost allocation schemes," Other publications TiSEM 98019ba4-13a2-470b-9850-f, Tilburg University, School of Economics and Management.
    18. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    19. Leanne Streekstra & Christian Trudeau, 2024. "Stable source connection and assignment problems as multi-period shortest path problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(3), pages 939-975, September.
    20. Dutta, Bhaskar & Mishra, Debasis, 2012. "Minimum cost arborescences," Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
    21. 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.
    22. Jeroen Kuipers & Ulrich Faigle & Walter Kern, 1998. "Note Computing the nucleolus of min-cost spanning tree games is NP-hard," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 443-450.
    23. 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.
    24. 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.
    25. Stefano Moretti & Henk Norde & Kim Pham Do & Stef Tijs, 2002. "Connection problems in mountains and monotonic allocation schemes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(1), pages 83-99, June.
    26. 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.
    27. 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.
    28. 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.
    29. Trudeau, Christian, 2014. "Minimum cost spanning tree problems with indifferent agents," Games and Economic Behavior, Elsevier, vol. 84(C), pages 137-151.
    30. 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.
    31. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    32. 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.
    33. 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.
    34. Bergantiños, Gustavo & Moreno-Ternero, Juan D., 2015. "The axiomatic approach to the problem of sharing the revenue from museum passes," Games and Economic Behavior, Elsevier, vol. 89(C), pages 78-92.
    35. Gustavo Bergantiños & Juan D. Moreno-Ternero, 2022. "On the axiomatic approach to sharing the revenues from broadcasting sports leagues," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 58(2), pages 321-347, February.
    36. S. C. Littlechild & G. Owen, 1973. "A Simple Expression for the Shapley Value in a Special Case," Management Science, INFORMS, vol. 20(3), pages 370-372, November.
    37. Trudeau, Christian & Vidal-Puga, Juan, 2017. "On the set of extreme core allocations for minimal cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 169(C), pages 425-452.
    38. Eric Bahel & Christian Trudeau, 2017. "Minimum incoming cost rules for arborescences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 287-314, August.
    39. 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.
    40. Gustavo Bergantiños & Leticia Lorenzo, 2005. "Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems," Annals of Operations Research, Springer, vol. 137(1), pages 101-115, July.
    41. 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.
    42. Fernandez, Francisco R. & Hinojosa, Miguel A. & Puerto, Justo, 2004. "Multi-criteria minimum cost spanning tree games," European Journal of Operational Research, Elsevier, vol. 158(2), pages 399-408, October.
    43. 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.
    44. 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.
    45. 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.
    46. Stef Tijs & Stefano Moretti & Rodica Branzei & Henk Norde, 2006. "The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects," Lecture Notes in Economics and Mathematical Systems, in: Alberto Seeger (ed.), Recent Advances in Optimization, pages 305-322, Springer.
    47. Bergantiños, Gustavo & Vidal-Puga, Juan, 2010. "Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms," European Journal of Operational Research, Elsevier, vol. 201(3), pages 811-820, March.
    48. 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.
    49. 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.
    50. 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.
    51. 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.
    52. 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.
    53. 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.
    54. Christian Trudeau, 2014. "Linking the Kar and folk solutions through a problem separation property," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 845-870, November.
    55. Aumann, Robert J. & Maschler, Michael, 1985. "Game theoretic analysis of a bankruptcy problem from the Talmud," Journal of Economic Theory, Elsevier, vol. 36(2), pages 195-213, August.
    56. Gustavo Bergantiños & Juan D. Moreno-Ternero, 2020. "Sharing the Revenues from Broadcasting Sport Events," Management Science, INFORMS, vol. 66(6), pages 2417-2431, June.
    57. Kuipers, Jeroen, 1993. "On the Core of Information Graph Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(4), pages 339-350.
    58. 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.
    59. Barış Çiftçi & Stef Tijs, 2009. "A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(2), pages 440-453, December.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    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. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Davila-Pena, Laura & Borm, Peter & Garcia-Jurado, Ignacio & Schouten, Jop, 2023. "An Allocation Rule for Graph Machine Scheduling Problems," Discussion Paper 2023-009, Tilburg University, Center for Economic Research.
    14. 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.
    15. Bergantiños, Gustavo & Martínez, Ricardo, 2014. "Cost allocation in asymmetric trees," European Journal of Operational Research, Elsevier, vol. 237(3), pages 975-987.
    16. Dutta, Bhaskar & Mishra, Debasis, 2012. "Minimum cost arborescences," Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
    17. Christian Trudeau, 2014. "Linking the Kar and folk solutions through a problem separation property," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 845-870, November.
    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. 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.
    20. Anna Bogomolnaia & Ron Holzman & Hervé Moulin, 2010. "Sharing the Cost of a Capacity Network," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 173-192, February.

    More about this item

    Keywords

    minimum cost spanning tree problems; cooperative games; core; Shapley value;
    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:104911. 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.