Bottleneck routing with elastic demands
From MaRDI portal
Publication:2417055
DOI10.1016/j.orl.2017.11.007OpenAlexW2773135462MaRDI QIDQ2417055
Max Klimm, Tobias Harks, Manuel K. Schneider
Publication date: 11 June 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2017.11.007
Cites Work
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Network congestion control with Markovian multipath routing
- Atomic routing games on maximum congestion
- Equilibria in a class of aggregative location games
- The mathematics of internet congestion control
- Strong equilibria in games with the lexicographical improvement property
- Congestion games revisited
- A class of games possessing pure-strategy Nash equilibria
- Congestion Games with Variable Demands
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Bottleneck Congestion Games with Logarithmic Price of Anarchy
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games
- Bottleneck Routing with Elastic Demands
- Bottleneck links, variable demand, and the tragedy of the commons
- Computing Cournot-Nash Equilibria
- On the existence of equilibria in noncooperative optimal flow control
- On Delay-Independent Diagonal Stability of Max-Min Congestion Control
- Algorithms and Computation
This page was built for publication: Bottleneck routing with elastic demands
