Optimal equilibria in the non-cooperative game associated with cost spanning tree problem

DOI10.1007/s10479-005-2248-5zbMath1138.91356MaRDI QIDQ816509

Gustavo Bergantiños, Leticia Lorenzo

Publication date: 9 March 2006

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

Full work available at URL: https://doi.org/10.1007/s10479-005-2248-5

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

91A10: Noncooperative games

91A43: Games involving graphs

Related Items

Strategic sharing of a costly network, Minimum cost connection networks: truth-telling and implementation, Minimum cost spanning tree problems with groups, Additivity in minimum cost spanning tree problems, Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms, Opportune moment strategies for a cost spanning tree game, The minimum cost shortest-path tree game, Truth-telling and Nash equilibria in minimum cost spanning tree models, An axiomatic approach in minimum cost spanning tree problems with groups, AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING, Noncooperative cost spanning tree games with budget restrictions

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Axiomatization of the Shapley value on minimum cost spanning tree games
• A non-cooperative approach to the cost spanning tree problem.
• Sequencing games
• Operations research games: A survey. (With comments and rejoinder)
• NTU PERT games
• The assignment game. I: The core
• On the core and nucleolus of minimum cost spanning tree games
• Noncooperative cost spanning tree games with budget restrictions
• Fixed-Route Cost Allocation
• Minimum cost spanning tree games
• Totally Balanced Games and Games of Flow
• On the core of linear production games
• Cost allocation for a spanning tree
• On cost allocation for a spanning tree: A game theoretic approach
• Unnamed Item
• Unnamed Item