Load balancing congestion games and their asymptotic behavior

DOI10.1007/978-3-030-56534-3_10zbMath1497.91027OpenAlexW2197584954MaRDI QIDQ2087126

Hisao Kameda, Eitan Altman, Nisha Mishra, Corinne Touati

Publication date: 26 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56534-3_10

zbMATH Keywords

congestion gamesload balancingsemi-splittable gamesseveral equilibria

Mathematics Subject Classification ID

Potential and congestion games (91A14)

Cites Work

• Potential games
• A class of games possessing pure-strategy Nash equilibria
• Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
• Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
• A Survey of Uniqueness Results for Selfish Routing
• On the relationship between Nash—Cournot and Wardrop equilibria
• NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
• A Mixed Optimum in Symmetric Distributed Computer Systems

This page was built for publication: Load balancing congestion games and their asymptotic behavior