IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v19y2010i3d10.1007_s10878-008-9171-z.html
   My bibliography  Save this article

The price of atomic selfish ring routing

Author

Listed:
  • Bo Chen

    (University of Warwick)

  • Xujin Chen

    (Chinese Academy of Sciences)

  • Xiaodong Hu

    (Chinese Academy of Sciences)

Abstract

We study selfish routing in ring networks with respect to minimizing the maximum latency. Our main result is an establishment of constant bounds on the price of stability (PoS) for routing unsplittable flows with linear latency. We show that the PoS is at most 6.83, which reduces to 4.57 when the linear latency functions are homogeneous. We also show the existence of a (54,1)-approximate Nash equilibrium. Additionally we address some algorithmic issues for computing an approximate Nash equilibrium.

Suggested Citation

  • Bo Chen & Xujin Chen & Xiaodong Hu, 2010. "The price of atomic selfish ring routing," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 258-278, April.
    • Handle: RePEc:spr:jcomop:v:19:y:2010:i:3:d:10.1007_s10878-008-9171-z
    DOI: 10.1007/s10878-008-9171-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-008-9171-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-008-9171-z?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. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2007. "Fast, Fair, and Efficient Flows in Networks," Operations Research, INFORMS, vol. 55(2), pages 215-225, April.
    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. Wenjie Wang & Lei Xie, 2022. "Optimal pricing of crowdsourcing logistics services with social delivery capacity," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1447-1469, July.

    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. Parilina, Elena & Sedakov, Artem & Zaccour, Georges, 2017. "Price of anarchy in a linear-state stochastic dynamic game," European Journal of Operational Research, Elsevier, vol. 258(2), pages 790-800.
    2. Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.
    3. Gaëtan Fournier & Marco Scarsini, 2014. "Hotelling Games on Networks: Efficiency of Equilibria," Documents de travail du Centre d'Economie de la Sorbonne 14033, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    4. Angelelli, E. & Morandi, V. & Savelsbergh, M. & Speranza, M.G., 2021. "System optimal routing of traffic flows with user constraints using linear programming," European Journal of Operational Research, Elsevier, vol. 293(3), pages 863-879.
    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.
    6. 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.
    7. Correa, José R. & Schulz, Andreas S. & Stier-Moses, Nicolás E., 2008. "A geometric approach to the price of anarchy in nonatomic congestion games," Games and Economic Behavior, Elsevier, vol. 64(2), pages 457-469, November.
    8. Feng, Zengzhe & Gao, Ziyou & Sun, Huijun, 2014. "Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 63(C), pages 31-43.
    9. Sanjiv Kapoor & Junghwan Shin, 2020. "Price of Anarchy in Networks with Heterogeneous Latency Functions," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 755-773, May.
    10. Manxi Wu & Saurabh Amin & Asuman E. Ozdaglar, 2021. "Value of Information in Bayesian Routing Games," Operations Research, INFORMS, vol. 69(1), pages 148-163, January.
    11. Riccardo Colini-Baldeschi & Roberto Cominetti & Panayotis Mertikopoulos & Marco Scarsini, 2020. "When Is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic," Operations Research, INFORMS, vol. 68(2), pages 411-434, March.
    12. Bayram, Vedat & Tansel, Barbaros Ç. & Yaman, Hande, 2015. "Compromising system and user interests in shelter location and evacuation planning," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 146-163.

    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:spr:jcomop:v:19:y:2010:i:3:d:10.1007_s10878-008-9171-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.