Nash equilibria in discrete routing games with convex latency functions.
Martin GairingThomas LückingMarios MavronicolasBurkhard MonienManuel RodePublished in: J. Comput. Syst. Sci. (2008)
Keyphrases
- nash equilibria
- incomplete information
- game theory
- stochastic games
- continuous functions
- fictitious play
- nash equilibrium
- pure strategy
- game theoretic
- solution concepts
- convex functions
- routing protocol
- convex sets
- multi agent systems
- multiagent learning
- cooperative
- response time
- finite number
- computational complexity
- multi agent
- congestion games