Skip to main content
SpringerLink
Log in

Opportune moment strategies for a cost spanning tree game

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

Cost spanning tree problems concern the construction of a tree which provides a connection with the source for every node of the network. In this paper, we address cost sharing problems associated to these situations when the agents located at the nodes act in a non-cooperative way. A class of strategies is proposed which produce minimum cost spanning trees and, at the same time, are strong Nash equilibria for a non-cooperative game associated to the problem. They are also subgame perfect Nash equilibria.

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

References

  • Bergantiños G, Lorenzo L (2004). A non-cooperative approach to the cost spanning tree problem. Math Methods Oper Res 59: 393–403

    MATH  MathSciNet  Google Scholar 

  • Bergantiños G, Lorenzo L (2005). Optimal equilibria in the non-cooperative game associated with cost spanning tree problems. Ann Oper Res 137: 101–115

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Borm P, Hamers H, Hendrickx R (2001) Operations research games: a survey. TOP 9(2): 139–216

    Article  MATH  MathSciNet  Google Scholar 

  • Granot D, Huberman G (1981) Minimum cost spanning tree games. Math Program 21: 1–18

    Article  MATH  MathSciNet  Google Scholar 

  • Kruskal JB (1956) On the shortest spanning subtree of a graph and the travelling salesman problem. Proc Am Math Soc 7: 48–50

    Article  MathSciNet  Google Scholar 

  • Mutuswami S, Winter E (2002) Subscription mechanisms for network formation. J Econ Theory 106: 242–264

    Article  MATH  MathSciNet  Google Scholar 

  • Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Techn J 36: 1389–1401

    Google Scholar 

  • Van Damme E (1991) Stability and perfection of Nash equilibria. Springer, Berlin

    MATH  Google Scholar 

  • Wu BW, Chao K (2004) Spanning trees and optimization problems. CRC Press, West Palm Beach, FL, USA

Download references

Author information

Authors and Affiliations

  1. Seville University, Seville, Spain

    F. R. Fernández, A. M. Mármol & J. Puerto

  2. Department of Economics, Quantitative Methods and Economic History, Pablo de Olavide University, Ctra. Utrera, Km 1, 48013, Seville, Spain

    M. A. Hinojosa

Authors
  1. F. R. Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. A. Hinojosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. M. Mármol
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Puerto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. A. Hinojosa.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fernández, F.R., Hinojosa, M.A., Mármol, A.M. et al. Opportune moment strategies for a cost spanning tree game. Math Meth Oper Res 70, 451–463 (2009). https://doi.org/10.1007/s00186-008-0279-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-008-0279-9

Keywords

JEL Classification

Search

Navigation