Competitive routing over time
From MaRDI portal
Publication:719282
DOI10.1016/J.TCS.2011.05.055zbMATH Open1237.91051OpenAlexW2007051395MaRDI QIDQ719282FDOQ719282
Authors: Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, 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
Recommendations
- Competitive routing of traffic flows by navigation providers
- Competitive Online Multicommodity Routing
- Competitive online multicommodity routing
- scientific article; zbMATH DE number 1003263
- Competitive routing of virtual circuits with unknown duration
- Competitive routing in multicast communications
- Time-dependent routing
- Competitive routing in networks with polynomial costs
- Competitive local routing with constraints
convergenceNash equilibriumroutingequilibrium computationcoordination mechanismnetwork congestion games
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Noncooperative games (91A10) Other game-theoretic models (91A40)
Cites Work
- Algorithmic Game Theory
- A class of games possessing pure-strategy Nash equilibria
- Strong price of anarchy
- Potential games
- Title not available (Why is that?)
- Efficient continuous-time dynamic network flow algorithms
- Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games
- On the impact of combinatorial structure on congestion games
- Selfish load balancing
- Title not available (Why is that?)
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Intrinsic robustness of the price of anarchy
- Multiplicative updates outperform generic no-regret learning in congestion games (extended abstract)
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Convergence to approximate Nash equilibria in congestion games
- Scheduling independent tasks to reduce mean finishing time
- Coordination mechanisms for selfish scheduling
- Title not available (Why is that?)
- Efficient coordination mechanisms for unrelated machine scheduling
- Strong equilibria in games with the lexicographical improvement property
- Title not available (Why is that?)
- Approximation and Online Algorithms
- Routing games
- Title not available (Why is that?)
- An introduction to network flows over time
- The price of routing unsplittable flow
- Title not available (Why is that?)
- Concurrent imitation dynamics in congestion games
- Strong equilibrium in congestion games
- On the complexity of Pareto-optimal Nash and strong equilibria
- Strong and Pareto Price of Anarchy in Congestion Games
- Nash equilibria and the price of anarchy for flows over time
- Braess's paradox for flows over time
- Bottleneck links, variable demand, and the tragedy of the commons
- Nash dynamics in constant player and bounded jump congestion games
- When ignorance helps: graphical multicast cost sharing games
- The structure and complexity of Nash equilibria for a selfish routing game
- Title not available (Why is that?)
- Coordination mechanisms
- Equilibria in dynamic selfish routing
- Competitive routing over time
- A priority-based model of routing
- Non-clairvoyant scheduling games
- Title not available (Why is that?)
- Competitive online multicommodity routing
Cited In (22)
- Contention issues in congestion games
- Timed network games with clocks
- Decentralized utilitarian mechanisms for scheduling games
- Non-blind strategies in timed network congestion games
- Timed network games
- A Stackelberg strategy for routing flow over time
- Bounding Residence Times for Atomic Dynamic Routings
- Timed network games
- Equilibria in routing games with edge priorities
- Dynamic Atomic Congestion Games with Seasonal Flows
- Time-dependent routing
- Atomic dynamic flow games: adaptive vs. nonadaptive agents
- Nash equilibria and the price of anarchy for flows over time
- A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
- A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
- Competitive routing over time
- Algorithms – ESA 2004
- Timing matters: online dynamics in broadcast games
- Routing games over time with FIFO policy
- On the price of anarchy for flows over time
- Computing the price of anarchy in atomic network congestion games (invited talk)
- FIFO and randomized competitive packet routing games
This page was built for publication: Competitive routing over time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719282)
