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

Ioannis Caragiannis Angelo Fanelli

Published in: CoRR (2019)

Keyphrases

incomplete information
congestion games
nash equilibria
pure nash equilibria
game theoretic
pure nash equilibrium
evolutionary algorithm
first order logic
nash equilibrium
learning algorithm
cost function
weighted graph
round trip