Abstract
Traditionally traffic assignment problems (TAPs) have been formulated as non-cooperative games (NCGs), and Wardrop’s user equilibrium (UE) of a TAP as Nash equilibrium (NE) of the corresponding NCG. In this study, in contrast, we propose a mapping from finite NCGs (F-NCGs) to asymmetric TAPs (A-TAPs) on a two-way or urban network, in which the travel cost of one link depends on flows on other links. With the help of three route-based formulations of UE, we show that NE of an F-NCG is equivalent to UE of the corresponding A-TAP. Based on the new relationship, we extend Nash’s fixed point formulation of NE to prove the existence of static UE. This study provides a more complete picture of the relationships between NCGs and TAPs. In the future we will be interested in studying Nash’s fixed point formulation for dynamic UE.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
