TY - CHAP
T1 - Nash Equilibrium in a Road Network with Many Groups of Users
AU - Krylatov, Alexander
AU - Zakharov, Victor
AU - Tuovinen, Tero
N1 - Krylatov A., Zakharov V., Tuovinen T. (2020) Nash Equilibrium in a Road Network with Many Groups of Users. In: Optimization Models and Methods for Equilibrium Traffic Assignment. Springer Tracts on Transportation and Traffic, vol 15. Springer, Cham
PY - 2020/1/1
Y1 - 2020/1/1
N2 - In this chapter concentrates on the relationships between individual and group behaviour of drivers in a road network. Such relationships are established by comparing the optimal routing of drivers (system optimum of Wardrop), the competitive drivers’ groups routing (Nash equilibrium), and the selfish drivers routing (user equilibrium of Wardrop). Thus, the boundary conditions for traffic assignment in a road network were recently obtained for the first time. Wide analytical discussion on the topic as well as a survey of relevant references are presented. Moreover, a new behavioural model of traffic assignment in case of simultaneous selfish and group behaviour of drivers in a road network is formulated in the last section. An explicit solution to a behavioural traffic assignment problem is offered for a single-commodity linear network with non-interfering routes.
AB - In this chapter concentrates on the relationships between individual and group behaviour of drivers in a road network. Such relationships are established by comparing the optimal routing of drivers (system optimum of Wardrop), the competitive drivers’ groups routing (Nash equilibrium), and the selfish drivers routing (user equilibrium of Wardrop). Thus, the boundary conditions for traffic assignment in a road network were recently obtained for the first time. Wide analytical discussion on the topic as well as a survey of relevant references are presented. Moreover, a new behavioural model of traffic assignment in case of simultaneous selfish and group behaviour of drivers in a road network is formulated in the last section. An explicit solution to a behavioural traffic assignment problem is offered for a single-commodity linear network with non-interfering routes.
UR - http://www.scopus.com/inward/record.url?scp=85076786556&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-34102-2_3
DO - 10.1007/978-3-030-34102-2_3
M3 - Chapter
AN - SCOPUS:85076786556
SN - 9783030341015
T3 - Springer Tracts on Transportation and Traffic
SP - 45
EP - 70
BT - Optimization Models and Methods for Equilibrium Traffic Assignment
PB - Springer
CY - Cham
ER -