IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v109y2025i3d10.1007_s11134-025-09947-0.html
   My bibliography  Save this article

A strategic double-ended queuing model for shared transportation

Author

Listed:
  • Yuval Brief

    (School of Mathematical Sciences, Tel Aviv University)

  • Refael Hassin

    (School of Mathematical Sciences, Tel Aviv University)

Abstract

HOV lanes are restricted to vehicles with more than one person, and ride sharing can be used to be eligible to use them. This paper provides an analysis of such a system from the perspective of strategic queuing. Our model is unique with respect to the queuing theory literature, in that one who joins the corresponding double-ended queue chooses between doing it as a customer or as a server. We also allow travelers to choose unrestricted lanes. We study equilibrium strategies that agents might follow and the optimal strategies from a social view point and compare the two. The model is studied under two information levels, with the goal of determining the optimal number of passengers required for the HOV lanes.

Suggested Citation

  • Yuval Brief & Refael Hassin, 2025. "A strategic double-ended queuing model for shared transportation," Queueing Systems: Theory and Applications, Springer, vol. 109(3), pages 1-33, September.
    • Handle: RePEc:spr:queues:v:109:y:2025:i:3:d:10.1007_s11134-025-09947-0
    DOI: 10.1007/s11134-025-09947-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-025-09947-0
    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/s11134-025-09947-0?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.

    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:spr:queues:v:109:y:2025:i:3:d:10.1007_s11134-025-09947-0. 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: 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.