Combined traffic assignmebt model with game theory
The classical Wardrop principle assumes that users minimize either individual travel cost or overall system cost. Unlike the pure Wardrop equilibrium, this study deals with the problem of user equilibrium traffic assignment with game theory. We present a Stackelberg game on the network in which the SO player is the leader and the CournotNash and user equilibrium players are the followers. The Cournot-Nash and user equilibrium players select the route, which is given the SO players routing, in contrast, the SO player select the routes to minimize total system travel cost. Based on combined model, the traffic assignment method was discussed, and the VI and generalized Lagrange multiplier method was used to get the solution. A simple example is presented. The example result shows that the efficient of Stackelberg model is higher than that of the UE system or SO system.
game theory Nush equilibrium user equilibrium traffic assignment
Lu Huapu Yu Xinxin Li Yue Zhu Jianan Cheng Nan
Institute of transportation engineering Tsinghua University Beijing, China
国际会议
长沙
英文
978-981
2010-05-11（万方平台首次上网日期，不代表论文的发表时间）