Competitive routing over time
type: Item
instance of: scholarly article
title: Competitive routing over time
zbMATH Open document ID: 1237.91051
author: Martin Hoefer
author: Vahab S. Mirrokni
author: Heiko Röglin
author: Shang-Hua Teng
published in: Theoretical Computer Science
publication date: 2011-10-10T00:00:00Z
Mathematics Subject Classification ID: 91A40
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5955898
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: coordination mechanism
zbMATH Keywords: routing
zbMATH Keywords: network congestion games
zbMATH Keywords: convergence
zbMATH Keywords: equilibrium computation
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.05.055
OpenAlex ID: W2007051395
cites work: Concurrent imitation dynamics in congestion games
cites work: On the impact of combinatorial structure on congestion games
cites work: Strong price of anarchy
cites work: Equilibria in Dynamic Selfish Routing
cites work: Q3254691
cites work: The Price of Routing Unsplittable Flow
cites work: Q3579396
cites work: Q5365037
cites work: When ignorance helps: graphical multicast cost sharing games
cites work: Q3002821
cites work: Q3549721
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Q4633894
cites work: Nash Dynamics in Constant Player and Bounded Jump Congestion Games
cites work: Strong and Pareto Price of Anarchy in Congestion Games
cites work: Convergence to approximate Nash equilibria in congestion games
cites work: The price of anarchy of finite congestion games
cites work: Coordination mechanisms
cites work: Bottleneck links, variable demand, and the tragedy of the commons
cites work: Non-clairvoyant Scheduling Games
cites work: The complexity of pure Nash equilibria
cites work: Q5414563
cites work: Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
cites work: Efficient continuous-time dynamic network flow algorithms
cites work: The structure and complexity of Nash equilibria for a selfish routing game
cites work: Approximation and Online Algorithms
cites work: Q2776597
cites work: Competitive online multicommodity routing
cites work: Strong equilibria in games with the lexicographical improvement property
cites work: On the Complexity of Pareto-optimal Nash and Strong Equilibria
cites work: Strong equilibrium in congestion games
cites work: Coordination mechanisms for selfish scheduling
cites work: Multiplicative updates outperform generic no-regret learning in congestion games
cites work: Q4134686
cites work: Nash Equilibria and the Price of Anarchy for Flows over Time
cites work: Braess's paradox for flows over time
cites work: Potential games
cites work: Algorithmic Game Theory
cites work: Q4342505
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Q3524727
cites work: Intrinsic robustness of the price of anarchy
cites work: Q3549719
cites work: An Introduction to Network Flows over Time
cites work: Q3524729
DOI: 10.1016/J.TCS.2011.05.055
Recommended article: Competitive routing of traffic flows by navigation providers
Recommended article: Competitive Online Multicommodity Routing
Recommended article: Competitive online multicommodity routing
Recommended article: Q3128891
Recommended article: Competitive routing of virtual circuits with unknown duration
Recommended article: Competitive routing in multicast communications
Recommended article: Time-dependent routing
Recommended article: Competitive routing in networks with polynomial costs
Recommended article: Competitive Local Routing with Constraints
description: scientific article; zbMATH DE number 5955898