Standard

Atomic Routing Game with Capacity Constraints. / Pal'tseva, D. A.; Parfenov, A. P.

в: Automation and Remote Control, Том 80, № 10, 10.2019, стр. 1901-1911.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Pal'tseva, DA & Parfenov, AP 2019, 'Atomic Routing Game with Capacity Constraints', Automation and Remote Control, Том. 80, № 10, стр. 1901-1911. https://doi.org/10.1134/S0005117919100102

APA

Pal'tseva, D. A., & Parfenov, A. P. (2019). Atomic Routing Game with Capacity Constraints. Automation and Remote Control, 80(10), 1901-1911. https://doi.org/10.1134/S0005117919100102

Vancouver

Pal'tseva DA, Parfenov AP. Atomic Routing Game with Capacity Constraints. Automation and Remote Control. 2019 Окт.;80(10):1901-1911. https://doi.org/10.1134/S0005117919100102

Author

Pal'tseva, D. A. ; Parfenov, A. P. / Atomic Routing Game with Capacity Constraints. в: Automation and Remote Control. 2019 ; Том 80, № 10. стр. 1901-1911.

BibTeX

@article{d29cfd84661f4af5b6b2f8989f65473c,
title = "Atomic Routing Game with Capacity Constraints",
abstract = "A model of an 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. The cost of passing each arc is determined by an increasing and convex function that depends on the number of players. Algorithms for finding the Nash equilibrium and social optimum are developed. These algorithms have a polynomial time complexity. The model can be used for transport networks with limited traffic flows.",
keywords = "network games, routing games, network flows, Nash equilibrium, algorithm for finding equilibrium",
author = "Pal'tseva, {D. A.} and Parfenov, {A. P.}",
year = "2019",
month = oct,
doi = "10.1134/S0005117919100102",
language = "Английский",
volume = "80",
pages = "1901--1911",
journal = "Automation and Remote Control",
issn = "0005-1179",
publisher = "МАИК {"}Наука/Интерпериодика{"}",
number = "10",

}

RIS

TY - JOUR

T1 - Atomic Routing Game with Capacity Constraints

AU - Pal'tseva, D. A.

AU - Parfenov, A. P.

PY - 2019/10

Y1 - 2019/10

N2 - A model of an 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. The cost of passing each arc is determined by an increasing and convex function that depends on the number of players. Algorithms for finding the Nash equilibrium and social optimum are developed. These algorithms have a polynomial time complexity. The model can be used for transport networks with limited traffic flows.

AB - A model of an 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. The cost of passing each arc is determined by an increasing and convex function that depends on the number of players. Algorithms for finding the Nash equilibrium and social optimum are developed. These algorithms have a polynomial time complexity. The model can be used for transport networks with limited traffic flows.

KW - network games

KW - routing games

KW - network flows

KW - Nash equilibrium

KW - algorithm for finding equilibrium

U2 - 10.1134/S0005117919100102

DO - 10.1134/S0005117919100102

M3 - статья

VL - 80

SP - 1901

EP - 1911

JO - Automation and Remote Control

JF - Automation and Remote Control

SN - 0005-1179

IS - 10

ER -

ID: 148133059