scientific article; zbMATH DE number 6469163
From MaRDI portal
Publication:5501276
zbMath1318.90016MaRDI QIDQ5501276
Henry W. Lin, Éva Tardos, Tim Roughgarden
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noncooperative games (91A10) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Flows in graphs (05C21)
Related Items (10)
Network topology and the efficiency of equilibrium ⋮ Braess's paradox for flows over time ⋮ On the hardness of network design for bottleneck routing games ⋮ Efficient methods for selfish network design ⋮ How much can taxes help selfish routing? ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Informational Braess’ Paradox: The Effect of Information on Traffic Congestion ⋮ Network investment games with Wardrop followers ⋮ Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators
This page was built for publication:
