Noncooperative cost spanning tree games with budget restrictions

DOI10.1002/nav.20319zbMath1158.91330MaRDI QIDQ3612297

Gustavo Bergantiños, Leticia Lorenzo

Publication date: 3 March 2009

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11093/1107

zbMATH Keywords

game theory; equilibria; budget restrictions; cost spanning tree problem

Mathematics Subject Classification ID

91A10: Noncooperative games

91A43: Games involving graphs

Related Items

Optimal equilibria in the non-cooperative game associated with cost spanning tree problem, Minimum cost spanning tree problems with groups, Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms, A generalization of obligation rules for minimum cost spanning tree problems, An axiomatic approach in minimum cost spanning tree problems with groups, AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING

Cites Work

• Unnamed Item
• 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.
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
• Subscription mechanisms for network formation.
• The complexity of computing a Nash equilibrium
• On the core and nucleolus of minimum cost spanning tree games
• Cost allocation for a spanning tree
• On cost allocation for a spanning tree: A game theoretic approach