IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v147y2024icp19-37.html

Bicriteria Nash flows over time

Author

Listed:
  • Oosterwijk, Tim
  • Schmand, Daniel
  • Schröder, Marc

Abstract

Flows over time are a natural way to incorporate flow dynamics that arise in various applications such as traffic networks. In this paper we introduce a natural variant of the deterministic fluid queuing model in which users aim to minimize their costs subject to arrival at their destination before a pre-specified deadline. We determine the existence and the structure of Nash flows over time and fully characterize the price of anarchy for this model. The price of anarchy measures the ratio of the quality of the equilibrium and the quality of the optimum flow, where we evaluate the quality using two different natural performance measures: the throughput for a given deadline and the makespan for a given amount of flow. While it turns out that both prices of anarchy can be unbounded in general, we provide tight bounds for the important subclass of parallel path graphs.

Suggested Citation

  • Oosterwijk, Tim & Schmand, Daniel & Schröder, Marc, 2024. "Bicriteria Nash flows over time," Games and Economic Behavior, Elsevier, vol. 147(C), pages 19-37.
    • Handle: RePEc:eee:gamebe:v:147:y:2024:i:c:p:19-37
    DOI: 10.1016/j.geb.2024.06.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825624000836
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2024.06.002?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Daron Acemoglu & Asuman Ozdaglar, 2007. "Competition and Efficiency in Congested Markets," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 1-31, February.
    2. Frédéric Meunier & Nicolas Wagner, 2010. "Equilibrium Results for Dynamic Congestion Games," Transportation Science, INFORMS, vol. 44(4), pages 524-536, November.
    3. Marcus Kaiser, 2022. "Computation of Dynamic Equilibria in Series-Parallel Networks," Mathematics of Operations Research, INFORMS, vol. 47(1), pages 50-71, February.
    4. Ramesh Johari & Gabriel Y. Weintraub & Benjamin Van Roy, 2010. "Investment and Market Structure in Industries with Congestion," Operations Research, INFORMS, vol. 58(5), pages 1303-1317, October.
    5. Daniel Schmand, 2021. "Recent Developments in Mathematical Traffic Models," Springer Books, in: Michael Freitag & Herbert Kotzab & Nicole Megow (ed.), Dynamics in Logistics, pages 71-87, Springer.
    6. Roberto Cominetti & José Correa & Omar Larré, 2015. "Dynamic Equilibria in Fluid Queueing Networks," Operations Research, INFORMS, vol. 63(1), pages 21-34, February.
    7. L. R. Ford & D. R. Fulkerson, 1958. "Constructing Maximal Dynamic Flows from Static Flows," Operations Research, INFORMS, vol. 6(3), pages 419-433, June.
    8. 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.
    9. Harks, Tobias & Schröder, Marc & Vermeulen, Dries, 2019. "Toll caps in privatized road networks," European Journal of Operational Research, Elsevier, vol. 276(3), pages 947-956.
    10. Philipp von Falkenhausen & Tobias Harks, 2013. "Optimal Cost Sharing for Resource Selection Games," Mathematics of Operations Research, INFORMS, vol. 38(1), pages 184-208, February.
    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. 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.
    2. 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.
    3. Huang, Wentao & Jian, Sisi & Rey, David, 2024. "Non-additive network pricing with non-cooperative mobility service providers," European Journal of Operational Research, Elsevier, vol. 318(3), pages 802-824.
    4. Roberto Cominetti & José Correa & Neil Olver, 2022. "Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks," Operations Research, INFORMS, vol. 70(1), pages 516-526, January.
    5. Roberto Cominetti & José Correa & Omar Larré, 2015. "Dynamic Equilibria in Fluid Queueing Networks," Operations Research, INFORMS, vol. 63(1), pages 21-34, February.
    6. Graf, Lukas & Harks, Tobias & Palkar, Prashant, 2025. "Dynamic traffic assignment for electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 195(C).
    7. Marcus Kaiser, 2022. "Computation of Dynamic Equilibria in Series-Parallel Networks," Mathematics of Operations Research, INFORMS, vol. 47(1), pages 50-71, February.
    8. 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.
    9. Melo, Emerson, 2014. "Price competition, free entry, and welfare in congested markets," Games and Economic Behavior, Elsevier, vol. 83(C), pages 53-72.
    10. Cominetti, Roberto & Dose, Valerio & Scarsini, Marco, 2024. "Monotonicity of equilibria in nonatomic congestion games," European Journal of Operational Research, Elsevier, vol. 316(2), pages 754-766.
    11. Ying Bao & Jessie Liu, 2025. "Spiral of Silence: How Neutral Moderation Polarizes Content Creation," Papers 2511.19680, arXiv.org.
    12. Liu, Tian-Liang & Chen, Jian & Huang, Hai-Jun, 2011. "Existence and efficiency of oligopoly equilibrium under toll and capacity competition," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 908-919.
    13. Harks, Tobias & Schröder, Marc & Vermeulen, Dries, 2019. "Toll caps in privatized road networks," European Journal of Operational Research, Elsevier, vol. 276(3), pages 947-956.
    14. José Correa & Cristóbal Guzmán & Thanasis Lianeas & Evdokia Nikolova & Marc Schröder, 2022. "Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators," Operations Research, INFORMS, vol. 70(1), pages 472-489, January.
    15. 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.
    16. Georgia Perakis & Wei Sun, 2014. "Efficiency Analysis of Cournot Competition in Service Industries with Congestion," Management Science, INFORMS, vol. 60(11), pages 2684-2700, November.
    17. 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.
    18. 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.
    19. Elisabeth Lübbecke & Marco E. Lübbecke & Rolf H. Möhring, 2019. "Ship Traffic Optimization for the Kiel Canal," Operations Research, INFORMS, vol. 67(3), pages 791-812, May.
    20. Randall Berry & Michael Honig & Thành Nguyen & Vijay Subramanian & Rakesh Vohra, 2020. "The Value of Sharing Intermittent Spectrum," Management Science, INFORMS, vol. 66(11), pages 5242-5264, November.

    More about this item

    Keywords

    ;
    ;
    ;

    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:147:y:2024:i:c:p:19-37. 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.