Convergence to approximate Nash equilibria in congestion games
From MaRDI portal
Publication:632952
DOI10.1016/J.GEB.2009.05.004zbMATH Open1209.91020OpenAlexW1990873282MaRDI QIDQ632952FDOQ632952
Authors: Steve Chien, Alistair Sinclair 
Publication date: 28 March 2011
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2009.05.004
Recommendations
- Convergence to approximate Nash equilibria in congestion games
- Convergence issues in congestion games
- Improving approximate pure Nash equilibria in congestion games
- On the Performance of Approximate Equilibria in Congestion Games
- On the performance of approximate equilibria in congestion games
- Convergence Dynamics of Graphical Congestion Games
- Approximate pure Nash equilibria in weighted congestion games
- Bounding the potential function in congestion games and approximate pure Nash equilibria
- Convergence of best-response dynamics in games with conflicting congestion effects
polynomial timeapproximate Nash equilibriacongestion gamesconvergence to equilibriumbest-response dynamicsPLS-completenesssymmetric congestion games
Cites Work
- Equilibrium points in n -person games
- Bounding the inefficiency of equilibria in nonatomic congestion games
- A class of games possessing pure-strategy Nash equilibria
- How easy is local search?
- Congestion games with player-specific payoff functions
- Fast convergence of selfish rerouting
- On the impact of combinatorial structure on congestion games
- Distributed Selfish Load Balancing
- Title not available (Why is that?)
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
- Simple Local Search Problems that are Hard to Solve
- Algorithms, games, and the internet
- The price of routing unsplittable flow
- Convergence to approximate Nash equilibria in congestion games
- Routing without regret, on convergence to Nash equilibria of regret-minimizing algorithms in routing games
- The complexity of computing a Nash equilibrium
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Title not available (Why is that?)
- Approximate local search in combinatorial optimization
Cited In (49)
- The Speed of Convergence in Congestion Games under Best-Response Dynamics
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- On the Performance of Approximate Equilibria in Congestion Games
- Decentralized utilitarian mechanisms for scheduling games
- Convergence Dynamics of Graphical Congestion Games
- Potential games, path independence and Poisson's binomial distribution
- Nash dynamics in constant player and bounded jump congestion games
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria
- Concurrent imitation dynamics in congestion games
- Approaching equilibrium in parallel
- On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
- Approximate Pure Nash Equilibria in Social Context Congestion Games
- Title not available (Why is that?)
- Chaotic congestion games
- Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints
- Equilibrium computation in resource allocation games
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Atomic congestion games: fast, myopic and concurrent
- Asynchronous congestion games
- On the convergence to Nash equilibrium in problems of distributed computing
- Decentralized dynamics for finite opinion games
- Fast convergence of best-reply dynamics in aggregative games
- On the performance of approximate equilibria in congestion games
- Computing approximate Nash equilibria in network congestion games
- Convergence of incentive-driven dynamics in Fisher markets
- Online learning of Nash equilibria in congestion games
- Computing Approximate Nash Equilibria in Network Congestion Games
- Approximation and Convergence of Large Atomic Congestion Games
- On the impact of fair best response dynamics
- Pure Nash equilibria in restricted budget games
- Congestion games with mixed objectives
- Convergence to approximate Nash equilibria in congestion games
- On the performance of mildly greedy players in cut games
- Congestion games with complementarities
- Atomic Congestion Games: Fast, Myopic and Concurrent
- Computing better approximate pure Nash equilibria in cut games via semidefinite programming
- Competitive routing over time
- Convergence of Ordered Improvement Paths in Generalized Congestion Games
- On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies
- On lookahead equilibria in congestion games
- Evolution of Mixed Strategies in Monotone Games
- Heterogeneity and chaos in congestion games
- Approximate Nash equilibria in anonymous games
- Convergence issues in congestion games
- The speed of convergence in congestion games under best-response dynamics
- Congestion Games with Mixed Objectives
- Computing approximate equilibria in weighted congestion games via best-responses
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
This page was built for publication: Convergence to approximate Nash equilibria in congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632952)
