|
Contributions to Game Theory and Management, 2017, том 10, страницы 162–174
(Mi cgtm305)
|
|
|
|
Эта публикация цитируется в 2 научных статьях (всего в 2 статьях)
Game-theoretic approach for modeling of selfish and group routing
Alexander Yu. Krylatov, Victor V. Zakharov St. Petersburg State University,
7/9 Universitetskaya nab., St.Petersburg, 199034, Russia
Аннотация:
The development of methodological tools for modeling of traffic flow assignment is crucial issue since traffic conditions influence significantly on quality of life nowadays. Herewith no secret that the development of invehicle route guidance and information systems could impact significantly on route choice as soon as it is highly believed that they are able to reduce congestion in an urban traffic area. Networks’ users join groups of drivers who rely on the same route guidance system. Therefore, present paper is devoted to discussing approaches for modeling selfish and group routing. Network performance is deeply associated with competition between users of networks. So, the emphasis in our discussion is placed on game-theoretic approaches for appropriate modeling.
Ключевые слова:
traffic assignment problem, selfish routing, user equilibrium of Wardrop, group routing, Nash equilibrium, system optimum of Wardrop.
Образец цитирования:
Alexander Yu. Krylatov, Victor V. Zakharov, “Game-theoretic approach for modeling of selfish and group routing”, Contributions to Game Theory and Management, 10 (2017), 162–174
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/cgtm305 https://www.mathnet.ru/rus/cgtm/v10/p162
|
Статистика просмотров: |
Страница аннотации: | 278 | PDF полного текста: | 178 | Список литературы: | 40 |
|