Login / Signup

On approximate pure Nash equilibria in weighted congestion games with polynomial latencies.

Ioannis CaragiannisAngelo Fanelli
Published in: J. Comput. Syst. Sci. (2021)
Keyphrases
  • pure nash equilibria
  • congestion games
  • game theoretic
  • pure nash equilibrium
  • nash equilibria
  • nash equilibrium
  • machine learning
  • cost function
  • game theory
  • lower bound
  • pure strategy