Atomic routing game with capacity constraints
A model of atomic routing game is considered. A network in this model has capacity constraints. Players in this game choose routes from some sources to one sink. A cost for each arc is determined by function which is increasing and convex. Algorithms finding Nash equilibrium and social optimum are constructed. These algorithms have polynomial-time complexity. This model can be used for transport networks with bounded traffic.