Login / Signup
On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games.
Vittorio Bilò
Published in:
CoRR (2014)
Keyphrases
</>
congestion games
nash equilibria
exact and approximate
learning algorithm
pure nash equilibria
machine learning
multi agent
evolutionary algorithm
cost function
upper bound