Price of Anarchy for Highly Congested Routing Games in Parallel Networks.
Riccardo Colini-BaldeschiRoberto CominettiMarco ScarsiniPublished in: Theory Comput. Syst. (2019)
Keyphrases
- network topologies
- interconnection networks
- network resources
- routing algorithm
- dynamic routing
- wireless ad hoc networks
- game theory
- video games
- network design
- network topology
- switched networks
- packet switched
- network nodes
- traffic engineering
- nash equilibria
- social networks
- multi agent systems
- routing problem
- parallel implementation
- complex networks
- network structure
- shortest path
- mobile ad hoc networks
- parallel computing
- network infrastructure
- computer networks
- computer games
- link failure
- inter domain