Sign in
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions.
Vittorio Bilò
Michele Flammini
Gianpiero Monaco
Luca Moscardelli
Published in:
Distributed Comput. (2021)
Keyphrases
</>
congestion games
nash equilibria
cost function
incomplete information
pure nash equilibria
pure strategy
game theory
stochastic games
nash equilibrium
game theoretic
fictitious play
pure nash equilibrium
solution concepts
cooperative
objective function
linear programming
special case