Scientific publications

Д.А. Пальцева, А.П. Парфенов.

Атомическая игра маршрутизации с ограничениями на пропускную способность

// Математическая Теория Игр и ее Приложения, т. 10, в. 1. 2018. C. 65-82

Keywords: network games, routing games, network flows, Nash equilibrium, algorithm for searching equilibrium

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.

Indexed at RSCI, RSCI (WS)

vol_10_1_65-82_Parfenov.pdf (324 Kb, total downloads: 173)

Last modified: September 11, 2018