CaltechAUTHORS
  A Caltech Library Service

A Stackelberg strategy for routing flow over time

Bhaskar, Umang and Fleischer, Lisa and Anshelevich, Elliot (2015) A Stackelberg strategy for routing flow over time. Games and Economic Behavior, 92 . pp. 232-247. ISSN 0899-8256. https://resolver.caltech.edu/CaltechAUTHORS:20150918-140427288

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20150918-140427288

Abstract

Routing games are studied to understand the impact of individual users' decisions on network efficiency. Most prior work on efficiency in routing games uses a simplified model 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 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 are commonly used in transportation research. We show that in this model, by reducing network capacity judiciously, the network owner can ensure that the equilibrium is no worse than a small constant times the optimal in the original network, for two natural measures of optimality. These are the first upper bounds on the price of anarchy in this model for general networks.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1016/j.geb.2013.09.004DOIArticle
http://www.sciencedirect.com/science/article/pii/S0899825613001334PublisherArticle
Additional Information:© 2013 Elsevier Inc. Received 7 October 2011; Available online 27 September 2013. Partially supported by NSF grants CCF-0728869 and CCF-1016778. Partially supported by NSF grants CCF-0914782 and CNS-1017932. We are grateful to the referees of this paper and an earlier version appearing in Bhaskar et al. (2011) for their valuable feedback.
Funders:
Funding AgencyGrant Number
NSFCCF-0728869
NSFCCF-1016778
NSFCCF-0914782
NSFCNS-1017932
Subject Keywords:Routing games; Flows over time; Equilibrium; Efficiency
Classification Code:JEL: C720
Record Number:CaltechAUTHORS:20150918-140427288
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20150918-140427288
Official Citation:Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich, A Stackelberg strategy for routing flow over time, Games and Economic Behavior, Volume 92, July 2015, Pages 232-247, ISSN 0899-8256, http://dx.doi.org/10.1016/j.geb.2013.09.004. (http://www.sciencedirect.com/science/article/pii/S0899825613001334)
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:60337
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:20 Sep 2015 20:08
Last Modified:03 Oct 2019 08:56

Repository Staff Only: item control page