Login / Signup

Algorithms for pure Nash equilibria in weighted congestion games.

Panagiota N. PanagopoulouPaul G. Spirakis
Published in: ACM J. Exp. Algorithmics (2006)
Keyphrases
  • pure nash equilibria
  • learning algorithm
  • significant improvement
  • optimization problems
  • congestion games
  • mobile robot
  • computational cost
  • upper bound
  • worst case
  • pure nash equilibrium