Skip to Main content Skip to Navigation
New interface
Conference papers

Load Balancing Congestion Games and their Asymptotic Behavior

Abstract : A central question in routing games has been to establish conditions for the uniqueness of the equilibrium, either in terms of network topology or in terms of costs. This question is well understood in two classes of routing games. The first is the non-atomic routing introduced by Wardrop on 1952 in the context of road traffic in which each player (car) is infinitesimally small; a single car has a negligible impact on the congestion. Each car wishes to minimize its expected delay. Under arbitrary topology, such games are known to have a convex potential and thus a unique equilibrium. The second framework is splitable atomic games: there are finitely many players, each controlling the route of a population of individuals (let them be cars in road traffic or packets in the communication networks). In this paper, we study two other frameworks of routing games in which each of several players has an integer number of connections (which are population of packets) to route and where there is a constraint that a connection cannot be split. Through a particular game with a simple three link topology, we identify various novel and surprising properties of games within these frameworks. We show in particular that equilibria are non unique even in the potential game setting of Rosenthal with strictly convex link costs. We further show that non-symmetric equilibria arise in symmetric networks.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Eitan Altman Connect in order to contact the contributor
Submitted on : Tuesday, October 11, 2016 - 12:56:44 AM
Last modification on : Saturday, June 25, 2022 - 11:23:49 PM
Long-term archiving on: : Thursday, January 12, 2017 - 1:17:47 PM


Files produced by the author(s)



Eitan Altman, Corinne Touati. Load Balancing Congestion Games and their Asymptotic Behavior. NETGCOOP 2016: Network Games. Control and Optimization, Nov 2016, Avignon, France. pp.23-33, ⟨10.1007/978-3-319-51034-7_3⟩. ⟨hal-01378907⟩



Record views


Files downloads