Load Balancing Congestion Games and Their Asymptotic Behavior

DOI10.1007/978-3-319-51034-7_3zbMath1410.91114arXiv1512.09239OpenAlexW2964225926MaRDI QIDQ4607260

Corinne Touati, Eitan Altman

Publication date: 13 March 2018

Published in: Static & Dynamic Game Theory: Foundations & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.09239

zbMATH Keywords

multiple equilibriaasymptotic behaviorcongestion gamesload balancingrouting games

Mathematics Subject Classification ID

Noncooperative games (91A10) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Games with infinitely many players (91A07) Traffic problems in operations research (90B20)

Related Items (1)

Load Balancing Congestion Games and Their Asymptotic Behavior

Cites Work

• Potential games
• A class of games possessing pure-strategy Nash equilibria
• A Survey of Uniqueness Results for Selfish Routing
• On the relationship between Nash—Cournot and Wardrop equilibria
• Load Balancing Congestion Games and Their Asymptotic Behavior
• NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
• Potential games with continuous player sets

This page was built for publication: Load Balancing Congestion Games and Their Asymptotic Behavior