IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v92y2015icp232-247.html
   My bibliography  Save this article

A Stackelberg strategy for routing flow over time

Author

Listed:
  • Bhaskar, Umang
  • Fleischer, Lisa
  • Anshelevich, Elliot

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.

Suggested Citation

  • Bhaskar, Umang & Fleischer, Lisa & Anshelevich, Elliot, 2015. "A Stackelberg strategy for routing flow over time," Games and Economic Behavior, Elsevier, vol. 92(C), pages 232-247.
    • Handle: RePEc:eee:gamebe:v:92:y:2015:i:c:p:232-247
    DOI: 10.1016/j.geb.2013.09.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825613001334
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2013.09.004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bruce Hoppe & Éva Tardos, 2000. "The Quickest Transshipment Problem," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 36-62, February.
    2. Vickrey, William S, 1969. "Congestion Theory and Transport Investment," American Economic Review, American Economic Association, vol. 59(2), pages 251-260, May.
    3. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2004. "Selfish Routing in Capacitated Networks," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 961-976, November.
    4. Ramesh Johari & John N. Tsitsiklis, 2004. "Efficiency Loss in a Network Resource Allocation Game," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 407-435, August.
    5. Nadine Baumann & Martin Skutella, 2009. "Earliest Arrival Flows with Multiple Sources," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 499-512, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Roberto Cominetti & José Correa & Omar Larré, 2015. "Dynamic Equilibria in Fluid Queueing Networks," Operations Research, INFORMS, vol. 63(1), pages 21-34, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gur, Yonatan & Iancu, Dan & Warnes, Xavier, 2020. "Value Loss in Allocation Systems with Provider Guarantees," Research Papers 3813, Stanford University, Graduate School of Business.
    2. Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Dynamic Pricing and Pooling in Capacitated Networks," Papers 2307.03994, arXiv.org, revised Nov 2023.
    3. Yosuke Hanawa & Yuya Higashikawa & Naoyuki Kamiyama & Naoki Katoh & Atsushi Takizawa, 2018. "The mixed evacuation problem," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1299-1314, November.
    4. Hong Zheng & Yi-Chang Chiu & Pitu B. Mirchandani, 2015. "On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems," Transportation Science, INFORMS, vol. 49(1), pages 13-27, February.
    5. Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.
    6. Ismaila Abderhamane Ndiaye & Emmanuel Neron & Antoine Jouglet, 2017. "Macroscopic evacuation plans for natural disasters," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 231-272, January.
    7. Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
    8. Huibing Yin & Prashant Mehta & Sean Meyn & Uday Shanbhag, 2014. "On the Efficiency of Equilibria in Mean-Field Oscillator Games," Dynamic Games and Applications, Springer, vol. 4(2), pages 177-207, June.
    9. Elodie Adida & Georgia Perakis, 2014. "The effect of supplier capacity on the supply chain profit," Annals of Operations Research, Springer, vol. 223(1), pages 1-52, December.
    10. Justo Puerto & Anita Schöbel & Silvia Schwarze, 2008. "The path player game," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(1), pages 1-20, August.
    11. Patrick Maillé & Nicolás E. Stier-Moses, 2009. "Eliciting Coordination with Rebates," Transportation Science, INFORMS, vol. 43(4), pages 473-492, November.
    12. Yonatan Gur & Dan Iancu & Xavier Warnes, 2021. "Value Loss in Allocation Systems with Provider Guarantees," Management Science, INFORMS, vol. 67(6), pages 3757-3784, June.
    13. Ramesh Johari & John N. Tsitsiklis, 2009. "Efficiency of Scalar-Parameterized Mechanisms," Operations Research, INFORMS, vol. 57(4), pages 823-839, August.
    14. Ozgun Caliskan Demirag & Julie L. Swann, 2007. "Capacity allocation to sales agents in a decentralized logistics network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(7), pages 796-810, October.
    15. Urmila Pyakurel & Hari Nandan Nath & Stephan Dempe & Tanka Nath Dhamala, 2019. "Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal," Mathematics, MDPI, vol. 7(10), pages 1-29, October.
    16. Tobias Harks & Konstantin Miller, 2011. "The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games," Operations Research, INFORMS, vol. 59(6), pages 1491-1503, December.
    17. Sreekumaran, Harikrishnan & Hota, Ashish R. & Liu, Andrew L. & Uhan, Nelson A. & Sundaram, Shreyas, 2021. "Equilibrium strategies for multiple interdictors on a common network," European Journal of Operational Research, Elsevier, vol. 288(2), pages 523-538.
    18. de Palma, André & Lindsey, Robin, 2001. "Optimal timetables for public transportation," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 789-813, September.
    19. Simon P. Anderson & Régis Renault, 2011. "Price Discrimination," Chapters, in: André de Palma & Robin Lindsey & Emile Quinet & Roger Vickerman (ed.), A Handbook of Transport Economics, chapter 22, Edward Elgar Publishing.
    20. Hoang, Nam H. & Vu, Hai L. & Lo, Hong K., 2018. "An informed user equilibrium dynamic traffic assignment problem in a multiple origin-destination stochastic network," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 207-230.

    More about this item

    Keywords

    Routing games; Flows over time; Equilibrium; Efficiency;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:92:y:2015:i:c:p:232-247. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.