NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS

DOI10.1142/S0219198902000574zbMath1090.91513MaRDI QIDQ4797295

Yoshihisa Hosokawa, Hisao Kameda, Eitan Altman

Publication date: 2002

Published in: International Game Theory Review (Search for Journal in Brave)

zbMATH Keywords

uniquenessNash equilibriumdistributed computing

Mathematics Subject Classification ID

Games involving graphs (91A43) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Nonatomic aggregative games with infinitely many types ⋮ Graded modalities in strategy logic ⋮ Load Balancing Congestion Games and Their Asymptotic Behavior ⋮ A proposed solution for the load balancing problem on heterogeneous clusters based on a delayed neural network ⋮ Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks ⋮ Formation of stable and efficient social storage cloud ⋮ Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems ⋮ Load balancing congestion games and their asymptotic behavior

Cites Work

• Uniqueness of the solution for optimal static routing in open BCMP queueing networks
• Braess-like paradoxes in distributed computer systems
• Capacity allocation under noncooperative routing
• On the relationship between Nash—Cournot and Wardrop equilibria
• Competitive routing in networks with polynomial costs

This page was built for publication: NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS