Congestion games with linearly independent paths: convergence time and price of anarchy
From MaRDI portal
Publication:987402
DOI10.1007/s00224-009-9205-7zbMath1203.91036OpenAlexW2124888702WikidataQ59818450 ScholiaQ59818450MaRDI QIDQ987402
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
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (11)
Tight inefficiency bounds for perception-parameterized affine congestion games ⋮ A Selective Tour Through Congestion Games ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ The price of anarchy in series-parallel network congestion games ⋮ Capacitated network design games ⋮ Greediness and equilibrium in congestion games ⋮ Convergence of best-response dynamics in games with conflicting congestion effects ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ Congestion games viewed from M-convexity ⋮ Risk-Averse Selfish Routing ⋮ Internalization of social cost in congestion games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong equilibrium in cost sharing connection games
- Network topology and the efficiency of equilibrium
- Selfish load balancing and atomic congestion games
- Pure Nash equilibria in player-specific and weighted congestion games
- Efficient graph topologies in network routing games
- Strong equilibrium in congestion games
- Network structure and strong equilibrium in route selection games.
- 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
- Stackelberg Strategies for Atomic 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
- STACS 2004
- Exact Price of Anarchy for Polynomial Congestion Games
- Automata, Languages and Programming
- Algorithms – ESA 2005
- Selfish Routing in Capacitated Networks
- Automata, Languages and Programming
- The Price of Routing Unsplittable Flow
- The price of anarchy is independent of the network topology
This page was built for publication: Congestion games with linearly independent paths: convergence time and price of anarchy
