On a locally minimum cost forwarding game.

Stephan J. Eidenbenz Gunes Ercal-Ozkaya Adam Meyerson Allon G. Percus

Published in: FOWANC@MobiHoc (2009)

Keyphrases

minimum cost
np hard
network flow
network flow problem
approximation algorithms
spanning tree
game playing
capacity constraints
computer games
video games
game theory
network simplex algorithm
nash equilibrium
minimum cost flow
shortest path
edit operations