| Article ID: | iaor200972012 |
| Country: | Germany |
| Volume: | 70 |
| Issue: | 3 |
| Start Page Number: | 451 |
| End Page Number: | 463 |
| Publication Date: | Dec 2009 |
| Journal: | Mathematical Methods of Operations Research |
| Authors: | Puerto J, Fernndez F R, Hinojosa M A, Mrmol A M |
| Keywords: | minimum spanning trees, Nash equilibrium |
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.