Opportune moment strategies for a cost spanning tree game

DOI10.1007/s00186-008-0279-9zbMath1179.91051OpenAlexW2023156474WikidataQ58217238 ScholiaQ58217238MaRDI QIDQ1044215

Justo Puerto, Francisco Ramón Fernández García, Amparo M. Mármol, Miguel A. Hinojosa

Publication date: 11 December 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-008-0279-9

zbMATH Keywords

Nash equilibrianon-cooperative gamesspanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Noncooperative games (91A10) Games involving graphs (91A43)

Related Items (2)

The minimum cost shortest-path tree game ⋮ A non-cooperative game theory approach to cost sharing in networks

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A non-cooperative approach to the cost spanning tree problem.
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• Operations research games: A survey. (With comments and rejoinder)
• Subscription mechanisms for network formation.
• Minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach
• Spanning Trees and Optimization Problems

This page was built for publication: Opportune moment strategies for a cost spanning tree game