Competitive routing over time
From MaRDI portal
Publication:719282
DOI10.1016/j.tcs.2011.05.055zbMath1237.91051OpenAlexW2007051395MaRDI QIDQ719282
Heiko Röglin, Martin Hoefer, Vahab S. Mirrokni, Shang-Hua Teng
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.055
convergenceNash equilibriumroutingequilibrium computationcoordination mechanismnetwork congestion games
Noncooperative games (91A10) Other game-theoretic models (91A40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (16)
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents ⋮ On the Price of Anarchy for Flows over Time ⋮ Equilibria in routing games with edge priorities ⋮ Unnamed Item ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ Competitive routing over time ⋮ A Stackelberg strategy for routing flow over time ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ Unnamed Item ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ FIFO and randomized competitive packet routing games ⋮ Bounding Residence Times for Atomic Dynamic Routings ⋮ Non-blind strategies in timed network congestion games ⋮ Timed network games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Braess's paradox for flows over time
- Convergence to approximate Nash equilibria in congestion games
- Competitive routing over time
- The structure and complexity of Nash equilibria for a selfish routing game
- Coordination mechanisms
- Competitive online multicommodity routing
- When ignorance helps: graphical multicast cost sharing games
- Strong price of anarchy
- Coordination mechanisms for selfish scheduling
- Efficient continuous-time dynamic network flow algorithms
- Strong equilibrium in congestion games
- Potential games
- Strong equilibria in games with the lexicographical improvement property
- A class of games possessing pure-strategy Nash equilibria
- An Introduction to Network Flows over Time
- On the Complexity of Pareto-optimal Nash and Strong Equilibria
- On the impact of combinatorial structure on congestion games
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Bottleneck links, variable demand, and the tragedy of the commons
- Strong and Pareto Price of Anarchy in Congestion Games
- Non-clairvoyant Scheduling Games
- Equilibria in Dynamic Selfish Routing
- Nash Dynamics in Constant Player and Bounded Jump Congestion Games
- Nash Equilibria and the Price of Anarchy for Flows over Time
- Scheduling independent tasks to reduce mean finishing time
- Concurrent imitation dynamics in congestion games
- Intrinsic robustness of the price of anarchy
- Multiplicative updates outperform generic no-regret learning in congestion games
- Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
- Algorithmic Game Theory
- Approximation and Online Algorithms
- The Price of Routing Unsplittable Flow
This page was built for publication: Competitive routing over time
