Congestion games with linearly independent paths: convergence time and price of anarchy
DOI10.1007/S00224-009-9205-7zbMATH Open1203.91036DBLPjournals/mst/Fotakis10OpenAlexW2124888702WikidataQ59818450 ScholiaQ59818450MaRDI QIDQ987402FDOQ987402
Authors: Dimitris Fotakis 
Publication date: 13 August 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-009-9205-7
Recommendations
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- 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
- A convergence analysis of the price of anarchy in atomic 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
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- On the impact of combinatorial structure on congestion games
- 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
- Pure Nash equilibria in player-specific and weighted congestion games
- Strong equilibrium in cost sharing connection games
- Efficient graph topologies in network routing games
- Network structure and strong equilibrium in route selection games.
- Algorithms – ESA 2005
- Network topology and the efficiency of equilibrium
- The price of routing unsplittable flow
- Title not available (Why is that?)
- Strong equilibrium in congestion games
- Selfish load balancing and atomic 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 (24)
- The Speed of Convergence in Congestion Games under Best-Response Dynamics
- Contention issues in congestion games
- A Selective Tour Through 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
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Tight inefficiency bounds for perception-parameterized affine congestion games
- Congestion games viewed from M-convexity
- 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
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- Local smoothness and the price of anarchy in splittable congestion games
- The strong price of anarchy of linear bottleneck congestion games
- Price of anarchy for parallel link networks with generalized mean objective
- Convergence of best-response dynamics in games with conflicting congestion effects
- Capacitated network design games
- Title not available (Why is that?)
- Price of anarchy for highly congested routing games in parallel networks
- Internalization of social cost in congestion games
- Performance of one-round walks in linear congestion games
- Risk-Averse Selfish Routing
- Greediness and equilibrium in congestion games
- The price of anarchy in series-parallel network congestion games
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 Q987402)
