The minimum cost shortest-path tree game

DOI10.1007/s10479-011-1043-8zbMath1259.91010OpenAlexW2050347249WikidataQ58217176 ScholiaQ58217176MaRDI QIDQ1761744

Justo Puerto, Francisco Ramón Fernández García

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1007/s10479-011-1043-8

zbMATH Keywords

Nash equilibriumcore solutionoperations research games

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items (1)

Extreme value distributions for two kinds of path sums of Markov chain

Cites Work

• Unnamed Item
• Unnamed Item
• Balanced per capita contributions and level structure of cooperation
• A non-cooperative approach to the cost spanning tree problem.
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• An extension to rapid transit network design problem
• Opportune moment strategies for a cost spanning tree game
• Operations research games: A survey. (With comments and rejoinder)
• Cost allocation in shortest path games
• On shortest path games
• Multi-criteria minimum cost spanning tree games
• Shortest shortest path trees of a network
• Minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach
• Spanning Trees and Optimization Problems
• Routing to Multiple Destinations in Computer Networks
• Partially Ordered Sets

This page was built for publication: The minimum cost shortest-path tree game