IDEAS home Printed from https://ideas.repec.org/h/spr/stcchp/978-3-319-33771-5_10.html

Queueing Problems with Two Parallel Servers

In: Fair Queueing

Author

Listed:
  • Youngsub Chun

    (Seoul National University)

Abstract

We generalize the queueing problem by assuming that the facility has two parallel servers so that two agents can be served at the same time. Once again, we are interested in finding the order in which to serve agents and the monetary transfers they should receive. Similarly to the queueing problem with one server, we introduce the “minimal transfer rule” and the “maximal transfer rule” for the queueing problem with two parallel servers and show that they correspond to the Shapley (Contributions to the theory of games II. Princeton University Press, Princeton, 1953) value of queueing games with two parallel servers, for two alternative definitions of the worth of a coalition. If the worth of a coalition is defined by assuming the coalitional members are served before the non-coalitional members, then the minimal transfer rule is obtained. If it is defined by assuming the coalitional members are served after the non-coalitional members, then the maximal transfer rule is obtained.

Suggested Citation

  • Youngsub Chun, 2016. "Queueing Problems with Two Parallel Servers," Studies in Choice and Welfare, in: Fair Queueing, chapter 0, pages 141-157, Springer.
    • Handle: RePEc:spr:stcchp:978-3-319-33771-5_10
    DOI: 10.1007/978-3-319-33771-5_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. is not listed on IDEAS
    2. Atay, Ata & Trudeau, Christian, 2024. "Queueing games with an endogenous number of machines," Games and Economic Behavior, Elsevier, vol. 144(C), pages 104-125.
    3. Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 473-480, March.
    4. Stark, Oded & Budzinski, Wiktor & Kosiorowski, Grzegorz, 2019. "Switching queues, cultural conventions, and social welfare," European Journal of Operational Research, Elsevier, vol. 278(3), pages 837-844.
    5. Kazuhiko Hashimoto & Hiroki Saitoh, 2008. "Strategy-Proof and Anonymous Rule in Queueing Problems: A Relationship between Equity and Efficiency," Discussion Papers in Economics and Business 08-17, Osaka University, Graduate School of Economics.
    6. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2019. "Recent developments in the queueing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 1-23, April.

    More about this item

    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:stcchp:978-3-319-33771-5_10. 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.