Avoiding the Braess paradox in non-cooperative networks

DOI10.1239/jap/1032374242zbMath0942.60091MaRDI QIDQ4261298

Ariel Orda, Aurel A. Lazar, Yannis A. Korilis

Publication date: 21 August 2000

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0610fdc353379e1dfc3735be01769cdeaf31b257

zbMATH Keywords

non-cooperative games; routing; computer communication networks; Braess paradox

Mathematics Subject Classification ID

90B18: Communication networks in operations research

68M10: Network design and communication in computer systems

60K30: Applications of queueing theory (congestion, allocation, storage, traffic, etc.)

Related Items

Fragile networks: identifying vulnerabilities and synergies in an uncertain age, Optimal speeds for walking and running, and walking on a moving walkway, Computing the Value of Information in Quadratic Stochastic Decision Problems, The price of anarchy is independent of the network topology, Multicriteria network equilibrium modeling with variable weights for decision-making in the Information Age with applications to telecommuting and teleshopping, The internet, evolutionary variational inequalities, and the time-dependent Braess paradox, The problem of capacity addition in multi-user elastic demand communication networks, On the severity of Braess's paradox: designing networks for selfish users is hard, A survey on networking games in telecommunications, A paradox in optimal flow control of \(M/M/n\) queues, Braess's Paradox in large random graphs, A Survey of Uniqueness Results for Selfish Routing