Congestion games with linearly independent paths: convergence time and price of anarchy

DOI10.1007/S00224-009-9205-7MaRDI QIDQ987402zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

price of anarchyprice of stabilitybest response dynamicsnetwork congestion games

Mathematics Subject Classification ID

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)

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

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Algorithms – ESA 2005
• Automata, Languages and Programming
• Automata, Languages and Programming
• Convergence time to Nash equilibrium in load balancing
• Convergence to approximate Nash equilibria in congestion games
• Efficient graph topologies in network routing games
• Exact Price of Anarchy for Polynomial Congestion Games
• How bad is selfish routing?
• Network flows. Theory, algorithms, and applications.
• Network structure and strong equilibrium in route selection games.
• Network topology and the efficiency of equilibrium
• On the impact of combinatorial structure on congestion games
• Pure Nash equilibria in player-specific and weighted congestion games
• STACS 2004
• Selfish Routing in Capacitated Networks
• Selfish load balancing and atomic congestion games
• Stackelberg Strategies for Atomic Congestion Games
• Strong equilibrium in congestion games
• Strong equilibrium in cost sharing connection games
• The Price of Stability for Network Design with Fair Cost Allocation
• The complexity of pure Nash equilibria
• The price of anarchy is independent of the network topology
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow
• Tight Bounds for Selfish and Greedy Load Balancing
• Worst-case equilibria

Cited in

(25)

• The Speed of Convergence in Congestion Games under Best-Response Dynamics
• Contention issues in congestion games
• Performances of One-Round Walks in Linear Congestion Games
• Convergence Dynamics of Graphical Congestion Games
• Risk-averse selfish routing
• Computation and efficiency of potential function minimizers of combinatorial congestion games
• A convergence analysis of the price of anarchy in atomic congestion games
• Tight inefficiency bounds for perception-parameterized affine congestion games
• Congestion games viewed from M-convexity
• Computation of equilibria and the price of anarchy in bottleneck congestion games
• A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton 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
• Inefficiency of pure Nash equilibria in series-parallel network congestion games
• Capacitated network design games
• scientific article; zbMATH DE number 5823841 (Why is no real title available?)
• Price of anarchy for highly congested routing games in parallel networks
• Internalization of social cost in congestion games
• A selective tour through congestion games
• Performance of one-round walks in linear congestion games
• 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)