Skip to Main content Skip to Navigation
Conference papers

Congestion load balancing game with losses

Abstract : We study the symmetric version of the load balancing game introduced by H. Kameda. We consider a non-splittable atomic game with lossy links. Thus costs are not additive and flow is not conserved (total flow entering a link is greater than the flow leaving it). We show that there is no unique equilibrium in the game. We identify several symmetric equilibria and show how the number of equilib-ria depends on the problem's parameters. We compute the globally optimal solution and compare its performance to the equilibrium. We finally identify the Kameda paradox which was introduced initially in networks without losses.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Eitan Altman <>
Submitted on : Sunday, September 6, 2020 - 2:00:03 AM
Last modification on : Thursday, December 10, 2020 - 4:22:12 PM
Long-term archiving on: : Wednesday, December 2, 2020 - 9:07:27 PM


Files produced by the author(s)


  • HAL Id : hal-02931311, version 1


Babacar Toure, Simon Paturel, Eitan Altman. Congestion load balancing game with losses. WINCOM'20 - 8th International Conference on Wireless Networks and Mobile Communications, Oct 2020, Reims, France. ⟨hal-02931311⟩



Record views


Files downloads