IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i4p3261-3281.html

Bounding Residence Times for Atomic Dynamic Routings

Author

Listed:
  • Zhigang Cao

    (School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China)

  • Bo Chen

    (Warwick Business School, University of Warwick, Coventry CV4 7AL, United Kingdom)

  • Xujin Chen

    (Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China; School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China)

  • Changjun Wang

    (Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China)

Abstract

In this paper, we are concerned with bounding agents’ residence times in the network for a broad class of atomic dynamic routings. We explore novel token techniques to circumvent direct analysis on complicated chain effects of dynamic routing choices. Even though agents may enter the network over time for an infinite number of periods, we prove that under a mild condition, the residence time of every agent is upper bounded (by a network-dependent constant plus the total number of agents inside the network at the entry time of the agent). Applying this result to three game models of atomic dynamic routing in the recent literature, we establish that the residence times of selfish agents in a series-parallel network with a single origin-destination pair are upper bounded at equilibrium, provided the number of incoming agents at each time point does not exceed the network capacity (i.e., the smallest total capacity of edges in the network whose removal separates the origin from the destination).

Suggested Citation

  • Zhigang Cao & Bo Chen & Xujin Chen & Changjun Wang, 2022. "Bounding Residence Times for Atomic Dynamic Routings," Mathematics of Operations Research, INFORMS, vol. 47(4), pages 3261-3281, November.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:4:p:3261-3281
    DOI: 10.1287/moor.2021.1242
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1242
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2021.1242?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
    ---><---

    References listed on IDEAS

    as
    1. Chris Hendrickson & George Kocur, 1981. "Schedule Delay and Departure Time Decisions in a Deterministic Model," Transportation Science, INFORMS, vol. 15(1), pages 62-77, February.
    2. Bruce Hoppe & Éva Tardos, 2000. "The Quickest Transshipment Problem," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 36-62, February.
    3. Roberto Cominetti & José Correa & Omar Larré, 2015. "Dynamic Equilibria in Fluid Queueing Networks," Operations Research, INFORMS, vol. 63(1), pages 21-34, February.
    4. Zhigang Cao & Bo Chen & Xujin Chen & Changjun Wang, 2021. "Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents," Operations Research, INFORMS, vol. 69(6), pages 1680-1695, November.
    5. Werth, T.L. & Holzhauser, M. & Krumke, S.O., 2014. "Atomic routing in a deterministic queuing model," Operations Research Perspectives, Elsevier, vol. 1(1), pages 18-41.
    Full references (including those not matched with items on IDEAS)

    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. Zhigang Cao & Bo Chen & Xujin Chen & Changjun Wang, 2021. "Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents," Operations Research, INFORMS, vol. 69(6), pages 1680-1695, November.
    2. Ryo Kawasaki & Hideo Konishi & Junki Yukawa, 2023. "Equilibria in bottleneck games," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 649-685, September.
    3. Mostafa Ameli & Mohamad Sadegh Shirani Faradonbeh & Jean-Patrick Lebacque & Hossein Abouee-Mehrizi & Ludovic Leclercq, 2022. "Departure Time Choice Models in Urban Transportation Systems Based on Mean Field Games," Transportation Science, INFORMS, vol. 56(6), pages 1483-1504, November.
    4. Leon Sering & Laura Vargas Koch & Theresa Ziemke, 2023. "Convergence of a Packet Routing Model to Flows over Time," Mathematics of Operations Research, INFORMS, vol. 48(3), pages 1741-1766, August.
    5. Terry E. Daniel & Eyran J. Gisches & Amnon Rapoport, 2009. "Departure Times in Y-Shaped Traffic Networks with Multiple Bottlenecks," American Economic Review, American Economic Association, vol. 99(5), pages 2149-2176, December.
    6. Yuya Higashikawa & Naoki Katoh, 2019. "A Survey on Facility Location Problems in Dynamic Flow Networks," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 163-208, October.
    7. Akamatsu, Takashi & Wada, Kentaro & Hayashi, Shunsuke, 2015. "The corridor problem with discrete multiple bottlenecks," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 808-829.
    8. Chen, Hongyu & Nie, Yu (Marco) & Yin, Yafeng, 2015. "Optimal multi-step toll design under general user heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 775-793.
    9. Yu Nie, 2015. "A New Tradable Credit Scheme for the Morning Commute Problem," Networks and Spatial Economics, Springer, vol. 15(3), pages 719-741, September.
    10. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    11. Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Capacity Sharing in Networks," Papers 2307.03994, arXiv.org, revised Nov 2025.
    12. Kenneth Small, 2015. "The Bottleneck Model: An Assessment and Interpretation," Working Papers 141506, University of California-Irvine, Department of Economics.
    13. Yi Liu & Mark Hansen, 2016. "Incorporating Predictability Into Cost Optimization for Ground Delay Programs," Transportation Science, INFORMS, vol. 50(1), pages 132-149, February.
    14. Chen, Zhi & Wu, Wen-Xiang & Huang, Hai-Jun & Shang, Hua-Yan, 2022. "Modeling traffic dynamics in periphery-downtown urban networks combining Vickrey's theory with Macroscopic Fundamental Diagram: user equilibrium, system optimum, and cordon pricing," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 278-303.
    15. S Opasanon & E Miller-Hooks, 2009. "The Safest Escape problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1749-1758, December.
    16. Sakai, Takara & Akamatsu, Takashi & Satsukawa, Koki, 2024. "Queue replacement principle for corridor problems with heterogeneous commuters," Transportation Research Part B: Methodological, Elsevier, vol. 187(C).
    17. Satsukawa, Koki & Wada, Kentaro & Iryo, Takamasa, 2024. "Stability analysis of a departure time choice problem with atomic vehicle models," Transportation Research Part B: Methodological, Elsevier, vol. 189(C).
    18. José Correa & Andrés Cristi & Tim Oosterwijk, 2022. "On the Price of Anarchy for Flows over Time," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1394-1411, May.
    19. Takayama, Yuki, 2018. "Time-varying congestion tolling and urban spatial structure," MPRA Paper 89896, University Library of Munich, Germany.
    20. Liu, Yang & Nie, Yu (Marco), 2011. "Morning commute problem considering route choice, user heterogeneity and alternative system optima," Transportation Research Part B: Methodological, Elsevier, vol. 45(4), pages 619-642.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    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:inm:ormoor:v:47:y:2022:i:4:p:3261-3281. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.