Login / Signup

On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games.

Vittorio Bilò
Published in: SAGT (2016)
Keyphrases
  • congestion games
  • cooperative
  • search space
  • cost function
  • nash equilibria
  • machine learning
  • incomplete information