The minimum cost shortest-path tree game
A minimum cost shortest-path tree is a tree that connects the source with every node of the network by a shortest path such that the sum of the cost (as a proxy for length) of all arcs is minimum.
operations research games core solution nash equilibrium