IDEAS home Printed from https://ideas.repec.org/p/dpr/wpaper/0683.html
   My bibliography  Save this paper

Queueing Problems with Two Parallel Servers

Author

Listed:
  • Youngsub Chun
  • Eun Jeong Heo

Abstract

A group of agents are waiting for their job to be processed in a facility. We assume that each agent needs the same amount of processing time and incurs waiting costs. The facility has two parallel servers, being able to serve two agents at a time. We are interested in finding the order to serve agents and the (positive or negative) monetary compensations they should receive. We introduce two rules for the problem, the minimal transfer rule and the maximal transfer rule. We show that these two rules correspond to the Shapley (1953) value of the queueing games with two servers, as discussed similarly by Maniquet (2003) and Chun (2006a) for queueing problems with one serve, when the worth of each coalition is appropriately defined. 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. On the other hand, 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 & Eun Jeong Heo, 2007. "Queueing Problems with Two Parallel Servers," ISER Discussion Paper 0683, Institute of Social and Economic Research, Osaka University.
    • Handle: RePEc:dpr:wpaper:0683
    as

    Download full text from publisher

    File URL: https://www.iser.osaka-u.ac.jp/library/dp/2007/DP0683.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Kar, Anirban & Mitra, Manipushpak & Mutuswami, Suresh, 2009. "On the coincidence of the prenucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 16-25, January.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Ata Atay & Christian Trudeau, 2022. "Queueing games with an endogenous number of machines," Working Papers 2202, University of Windsor, Department of Economics.

    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. García-Martínez, Jose A. & Mayor-Serra, Antonio J. & Meca, Ana, 2020. "Efficient Effort Equilibrium in Cooperation with Pairwise Cost Reduction," MPRA Paper 105604, University Library of Munich, Germany.
    2. Jose A. García-Martínez & Ana Meca & G. Alexander Vergara, 2022. "Cooperative Purchasing with General Discount: A Game Theoretical Approach," Mathematics, MDPI, vol. 10(22), pages 1-20, November.
    3. Trudeau, Christian & Vidal-Puga, Juan, 2020. "Clique games: A family of games with coincidence between the nucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 8-14.
    4. Yokote, Koji & Funaki, Yukihiko & Kamijo, Yoshio, 2017. "Coincidence of the Shapley value with other solutions satisfying covariance," Mathematical Social Sciences, Elsevier, vol. 89(C), pages 1-9.
    5. José M. Jiménez Gómez & María del Carmen Marco Gil & Pedro Gadea Blanco, 2010. "Some game-theoretic grounds for meeting people half-way," Working Papers. Serie AD 2010-04, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
    6. Conan Mukherjee, 2013. "Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(1), pages 131-163, February.
    7. Julio González-Díaz & Estela Sánchez-Rodríguez, 2014. "Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 821-843, November.
    8. Bendel, Dan & Haviv, Moshe, 2018. "Cooperation and sharing costs in a tandem queueing network," European Journal of Operational Research, Elsevier, vol. 271(3), pages 926-933.
    9. Pedro Gadea-Blanco & José-Manuel Giménez-Gómez & M. Carmen Marco-Gil, 2016. "Compromising in bifocal distribution games: the average value," Theory and Decision, Springer, vol. 81(3), pages 449-465, September.
    10. Chang, Chih & Tseng, Ying-Chih, 2011. "On the coincidence property," Games and Economic Behavior, Elsevier, vol. 71(2), pages 304-314, March.
    11. Koji Yokote & Yukihiko Funaki, 2015. "Several bases of a game space and an application to the Shapley value," Working Papers 1419, Waseda University, Faculty of Political Science and Economics.
    12. 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.
    13. Emilio Calvo, 2021. "Redistribution of tax resources: a cooperative game theory approach," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(4), pages 633-686, December.
    14. Youngsub Chun & Nari Park & Duygu Yengin, 2015. "Coincidence of Cooperative Game Theoretic Solutions in the Appointment Problem," School of Economics and Public Policy Working Papers 2015-09, University of Adelaide, School of Economics and Public Policy.
    15. Luis Guardiola & Ana Meca & Justo Puerto, 2020. "Quid Pro Quo allocations in Production-Inventory games," Papers 2002.00953, arXiv.org.
    16. Luis A. Guardiola & Ana Meca & Justo Puerto, 2021. "Enforcing fair cooperation in production-inventory settings with heterogeneous agents," Annals of Operations Research, Springer, vol. 305(1), pages 59-80, October.

    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:dpr:wpaper:0683. 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: Librarian (email available below). General contact details of provider: https://edirc.repec.org/data/isosujp.html .

    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.