Weakly-acyclic (internet) routing games

DOI10.1007/s00224-013-9474-zzbMath1380.91032OpenAlexW2181112974MaRDI QIDQ1678767

Michael Schapira, Roee Engelberg

Publication date: 7 November 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-013-9474-z

zbMATH Keywords

best-response dynamicsrouting gamesconvergence to Nash equilibriumweakly-acyclic games

Mathematics Subject Classification ID

Games involving graphs (91A43) Internet topics (68M11)

Related Items

Coordination Games on Weighted Directed Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the structure of weakly acyclic games
• Potential games
• Congestion games with player-specific payoff functions
• Improvement dynamics in games with strategic complementarities
• A class of games possessing pure-strategy Nash equilibria
• On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games
• Fault Tolerant Implementation
• A Classification of Weakly Acyclic Games
• Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games
• The Evolution of Conventions
• Learning in games by random sampling