Concurrent imitation dynamics in congestion games
From MaRDI portal
Publication:287990
DOI10.1007/s00446-014-0223-6zbMath1358.91008OpenAlexW2025273848MaRDI QIDQ287990
Heiner Ackermann, Martin Hoefer, Petra Berenbrink, Simon Fischer
Publication date: 23 May 2016
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-014-0223-6
Related Items (2)
The price of anarchy and stability in general noisy best-response dynamics ⋮ The lower convergence tendency of imitators compared to best responders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case equilibria
- Convergence to approximate Nash equilibria in congestion games
- Distributed algorithms for QoS load balancing
- Load balancing without regret in the bulletin board model
- On best response dynamics in weighted congestion games with polynomial delays
- Adaptive routing with stale information
- A guided tour of Chernoff bounds
- Atomic congestion games: fast, myopic and concurrent
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
- A class of games possessing pure-strategy Nash equilibria
- On the Impact of Fair Best Response Dynamics
- Distributed selfish load balancing with weights and speeds
- The speed of convergence in congestion games under best-response dynamics
- On the impact of combinatorial structure on congestion games
- Distributed Selfish Load Balancing
- Convergence time to Nash equilibrium in load balancing
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Atomic Congestion Games Among Coalitions
- Evolutionary Games and Population Dynamics
- Intrinsic robustness of the price of anarchy
- Multiplicative updates outperform generic no-regret learning in congestion games
- Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
- The Price of Routing Unsplittable Flow
This page was built for publication: Concurrent imitation dynamics in congestion games
