IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i4p3261-3281.html
   My bibliography  Save this article

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
    ---><---

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.