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.

Original languageEnglish
Title of host publicationCONTRIBUTIONS TO GAME THEORY AND MANAGEMENT, VOL X
EditorsLA Petrosyan, NA Zenkevich
PublisherИздательство Санкт-Петербургского университета
Pages162-174
Number of pages13
ISBN (Print)*****************
StatePublished - 2017
Event10th International Conference on Game Theory and Management (GMT2016) - St Petersburg, Russian Federation
Duration: 7 Jul 20169 Jul 2016

Publication series

NameContributions to Game Theory and Management
PublisherST PETERSBURG UNIV GRAD SCH MANAGEMENT
Volume10
ISSN (Print)2310-2608

Conference

Conference10th International Conference on Game Theory and Management (GMT2016)
Country/TerritoryRussian Federation
CitySt Petersburg
Period7/07/169/07/16

    Research areas

  • traffic assignment problem, selfish routing, user equilibrium of Wardrop, group routing, Nash equilibrium, system optimum of Wardrop, TRAFFIC ASSIGNMENT PROBLEM, NETWORKS, EQUILIBRIA, APPROXIMATION, FLOW

ID: 49097057