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

The Price of Anarchy for Instantaneous Dynamic Equilibria

Author

Listed:
  • Lukas Graf

    (Faculty of Computer Science and Mathematics, University of Passau, 94032 Passau, Germany)

  • Tobias Harks

    (Faculty of Computer Science and Mathematics, University of Passau, 94032 Passau, Germany)

Abstract

We consider flows over time within the deterministic queueing model of Vickrey and study the solution concept of instantaneous dynamic equilibrium (IDE), in which flow particles select at every decision point a currently shortest path. The length of such a path is measured by the physical travel time plus the time spent in queues. Although IDE has been studied since the eighties, the worst-case efficiency of the solution concept with respect to the travel time is not well understood. We study the price of anarchy for this model under the makespan and total travel time objective and show the first known upper bound for both measures of order O ( U · τ ) for single-sink instances, where U denotes the total inflow volume and τ denotes the sum of edge travel times. We complement this upper bound with a family of quite complex instances proving a lower bound of order Ω ( U · log τ ) .

Suggested Citation

  • Lukas Graf & Tobias Harks, 2023. "The Price of Anarchy for Instantaneous Dynamic Equilibria," Mathematics of Operations Research, INFORMS, vol. 48(4), pages 2167-2195, November.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:4:p:2167-2195
    DOI: 10.1287/moor.2022.1336
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1336
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1336?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:48:y:2023:i:4:p:2167-2195. 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.