Login / Signup
Nash Equilibria in Discrete Routing Games with Convex Latency Functions.
Martin Gairing
Thomas Lücking
Marios Mavronicolas
Burkhard Monien
Manuel Rode
Published in:
ICALP (2004)
Keyphrases
</>
nash equilibria
incomplete information
game theory
stochastic games
nash equilibrium
game theoretic
continuous functions
fictitious play
pure strategy
solution concepts
convex sets
congestion games
mixed strategy
multiagent learning
response time
convex functions
routing protocol