On the core and nucleolus of minimum cost spanning tree games.
Daniel GranotGur HubermanPublished in: Math. Program. (1984)
Keyphrases
- minimum cost
- spanning tree
- cooperative game
- solution concepts
- coalitional games
- np hard
- minimum spanning tree
- game theory
- game theoretic
- network flow
- nash equilibrium
- coalition formation
- minimum weight
- capacity constraints
- approximation algorithms
- optimal strategy
- nash equilibria
- minimum spanning trees
- network flow problem
- network simplex algorithm
- undirected graph
- edit operations
- integer programming
- minimum total cost
- feature space
- upper bound
- minimum cost flow
- edge weights