IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v46y2023i2d10.1007_s10878-023-01073-y.html
   My bibliography  Save this article

Tight bounds for the price of anarchy and stability in sequential transportation games

Author

Listed:
  • Francisco J. M. da Silva

    (University of Campinas)

  • Flávio K. Miyazawa

    (University of Campinas)

  • Ieremies V. F. Romero

    (University of Campinas)

  • Rafael C. S. Schouery

    (University of Campinas)

Abstract

In this paper, we analyze a transportation game first introduced by Fotakis, Gourvès, and Monnot in 2017, where players want to be transported to a common destination as quickly as possible and, to achieve this goal, they have to choose one of the available buses. We introduce a sequential version of this game and provide bounds for the Sequential Price of Stability and the Sequential Price of Anarchy in both metric and non-metric instances, considering three social cost functions: the total traveled distance by all buses, the maximum distance traveled by a bus, and the sum of the distances traveled by all players (a new social cost function that we introduce). Finally, we analyze the Price of Stability and the Price of Anarchy for this new function in simultaneous transportation games.

Suggested Citation

  • Francisco J. M. da Silva & Flávio K. Miyazawa & Ieremies V. F. Romero & Rafael C. S. Schouery, 2023. "Tight bounds for the price of anarchy and stability in sequential transportation games," Journal of Combinatorial Optimization, Springer, vol. 46(2), pages 1-20, September.
    • Handle: RePEc:spr:jcomop:v:46:y:2023:i:2:d:10.1007_s10878-023-01073-y
    DOI: 10.1007/s10878-023-01073-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-023-01073-y
    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-023-01073-y?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é Correa & Jasper de Jong & Bart de Keijzer & Marc Uetz, 2019. "The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing," Management Science, INFORMS, vol. 44(4), pages 1286-1303, November.
    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.

      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:46:y:2023:i:2:d:10.1007_s10878-023-01073-y. 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.