Avoiding the Braess paradox in non-cooperative networks
From MaRDI portal
Publication:4261298
DOI10.1239/jap/1032374242zbMath0942.60091OpenAlexW2080128220MaRDI QIDQ4261298
Yannis A. Korilis, Aurel A. Lazar, Ariel Orda
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
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (19)
Competitive routing of traffic flows by navigation providers ⋮ Dynamics of a 2D Piecewise Linear Braess Paradox Model: Effect of the Third Partition ⋮ Probabilistic selfish routing in parallel batch and single-server queues ⋮ Complexity and Approximation of the Continuous Network Design Problem ⋮ Capacitated network design games ⋮ Computing the Value of Information in Quadratic Stochastic Decision Problems ⋮ The internet, evolutionary variational inequalities, and the time-dependent Braess paradox ⋮ The problem of capacity addition in multi-user elastic demand communication networks ⋮ Fragile networks: identifying vulnerabilities and synergies in an uncertain age ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Locating inefficient links in a large-scale transportation network ⋮ Braess's Paradox in large random graphs ⋮ The price of anarchy is independent of the network topology ⋮ A Survey of Uniqueness Results for Selfish Routing ⋮ Non-Negativity of Information Value in Games, Symmetry and Invariance ⋮ Optimal speeds for walking and running, and walking on a moving walkway ⋮ A survey on networking games in telecommunications ⋮ A paradox in optimal flow control of \(M/M/n\) queues ⋮ Multicriteria network equilibrium modeling with variable weights for decision-making in the Information Age with applications to telecommuting and teleshopping
This page was built for publication: Avoiding the Braess paradox in non-cooperative networks
