Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
DOI10.1007/978-3-540-79309-0_5zbMATH Open1136.91342DBLPconf/sagt/Fotakis08OpenAlexW4243400642WikidataQ59818526 ScholiaQ59818526MaRDI QIDQ5459970FDOQ5459970
Authors: Dimitris Fotakis 
Publication date: 2 May 2008
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_5
Recommendations
- Congestion games with linearly independent paths: convergence time and price of anarchy
- The speed of convergence in congestion games under best-response dynamics
- Convergence issues in congestion games
- The Speed of Convergence in Congestion Games under Best-Response Dynamics
- On the impact of combinatorial structure on congestion games
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Communication networks in operations research (90B18) Games involving graphs (91A43) Network design and communication in computer systems (68M10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Worst-case equilibria
- Selfish Routing in Capacitated Networks
- The price of anarchy is independent of the network topology
- A class of games possessing pure-strategy Nash equilibria
- Convergence time to Nash equilibrium in load balancing
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Tight Bounds for Selfish and Greedy Load Balancing
- Strong equilibrium in cost sharing connection games
- Efficient graph topologies in network routing games
- Network structure and strong equilibrium in route selection games.
- Network topology and the efficiency of equilibrium
- The price of routing unsplittable flow
- Strong equilibrium in congestion games
- Stackelberg Strategies for Atomic Congestion Games
- STACS 2004
- Exact Price of Anarchy for Polynomial Congestion Games
- Automata, Languages and Programming
- Automata, Languages and Programming
Cited In (17)
- Contention issues in congestion games
- Performances of One-Round Walks in Linear Congestion Games
- Convergence Dynamics of Graphical Congestion Games
- A convergence analysis of the price of anarchy in atomic congestion games
- A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- Local smoothness and the price of anarchy in splittable congestion games
- The strong price of anarchy of linear bottleneck congestion games
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- Title not available (Why is that?)
- Price of anarchy for highly congested routing games in parallel networks
- Performance of one-round walks in linear congestion games
- Convergence of Ordered Improvement Paths in Generalized Congestion Games
- Stability vs. optimality in selfish ring routing
- Computing the price of anarchy in atomic network congestion games (invited talk)
- The speed of convergence in congestion games under best-response dynamics
This page was built for publication: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459970)
