a stackelberg strategy for routing flow over time：一个stackelberg策略路由流量随时间.pdf

Games and Economic Behavior 92 (2015) 232–247 Contents lists available at ScienceDirect Games and Economic Behavior /locate/geb A Stackelberg strategy for routing flow over time ✩ Umang Bhaskar a,∗,1,3 , Lisa Fleischer b,1, Elliot Anshelevich c,2 a California Institute of Technology, Pasadena, CA 91125, United States b Dartmouth College, Hanover, NH 03755, United States c Rensselaer Polytechnic Institute, Troy, NY 12180, United States a r t i c l e i n f o a b s t r a c t Article history: Routing games are studied to understand the impact of individual users’ decisions on Received 7 October 2011 network efficiency. Most prior work on efficiency in routing games uses a simplified model Available online 27 September 2013 where all flows exist simultaneously, and users care about either their maximum delay or their total delay. Both these measures are surrogates for measuring how long it takes JEL classification: C720 to get all of a user’s traffic through the network. We attempt a more direct study of network efficiency by examining routing games in a flow over time model. Flows over time Keywords: are commonly used in transportation research. We show that in this model, by reducing Routing games network capacity judiciously, the network