Congestion games viewed from M-convexity.

Satoru Fujishige Michel X. Goemans Tobias Harks Britta Peis Rico Zenklusen

Published in: Oper. Res. Lett. (2015)

Keyphrases

congestion games
nash equilibria
pure nash equilibria
incomplete information
nash equilibrium
pure nash equilibrium
decision making
computational complexity
dynamic programming
upper bound
dynamic environments
autonomous agents
critical points
pure strategy
convexity properties