Bottleneck Routing with Elastic Demands
From MaRDI portal
Publication:3460804
DOI10.1007/978-3-662-48995-6_28zbMath1404.91056OpenAlexW2400225708MaRDI QIDQ3460804
Tobias Harks, Manuel K. Schneider, Max Klimm
Publication date: 8 January 2016
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48995-6_28
Communication networks in operations research (90B18) Games involving graphs (91A43) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (1)
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
- Jetmax: Scalable max-min congestion control for high-speed heterogeneous networks
- 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 links, variable demand, and the tragedy of the commons
- 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
