Truth-telling and Nash equilibria in minimum cost spanning tree models.
Jens Leth HougaardMich TvedePublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- minimum cost
- spanning tree
- nash equilibria
- np hard
- minimum spanning tree
- approximation algorithms
- network flow
- minimum spanning trees
- network flow problem
- network simplex algorithm
- minimum cost flow
- capacity constraints
- minimum weight
- game theory
- stochastic games
- undirected graph
- nash equilibrium
- knowledge representation
- probabilistic model
- mobile robot
- special case