Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Game-Theoretic Approach for Modeling of Selfish and Group Routing. / Krylatov, Alexander Yu.; Zakharov, Victor V.
CONTRIBUTIONS TO GAME THEORY AND MANAGEMENT, VOL X. ed. / LA Petrosyan; NA Zenkevich. Издательство Санкт-Петербургского университета, 2017. p. 162-174 (Contributions to Game Theory and Management; Vol. 10).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Game-Theoretic Approach for Modeling of Selfish and Group Routing
AU - Krylatov, Alexander Yu.
AU - Zakharov, Victor V.
PY - 2017
Y1 - 2017
N2 - 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 in vehicle 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.
AB - 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 in vehicle 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.
KW - traffic assignment problem
KW - selfish routing
KW - user equilibrium of Wardrop
KW - group routing
KW - Nash equilibrium
KW - system optimum of Wardrop
KW - TRAFFIC ASSIGNMENT PROBLEM
KW - NETWORKS
KW - EQUILIBRIA
KW - APPROXIMATION
KW - FLOW
M3 - статья в сборнике материалов конференции
SN - *****************
T3 - Contributions to Game Theory and Management
SP - 162
EP - 174
BT - CONTRIBUTIONS TO GAME THEORY AND MANAGEMENT, VOL X
A2 - Petrosyan, LA
A2 - Zenkevich, NA
PB - Издательство Санкт-Петербургского университета
Y2 - 7 July 2016 through 9 July 2016
ER -
ID: 49097057