{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:59:01Z","timestamp":1750309141770,"version":"3.41.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T00:00:00Z","timestamp":1716249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>We consider a strategic resource pooling interaction between two service providers, each of which is modelled as a multi-server queue. The traditional full resource pooling mechanism, while improving the overall system performance measure, may not always benefit the providers individually. For rational service providers, there will therefore be no incentive to form a stable coalition. We address this issue by proposing three partial sharing mechanisms: two of these, Partial Pooling with Dedicated Servers and Partial Pooling with Repacking, allow each provider to designate a certain number of servers to potentially serve jobs of the other provider, while the third mechanism, Differential Queue Length, maintains an upper bound on the difference between occupancies of the two queues. We determine the probability of waiting for each of the three mechanisms and show through several numerical examples that their Pareto frontiers are non-empty. In particular, this shows that the proposed partial pooling mechanisms are individually beneficial to both providers and incentivize coalition formation in all situations. Finally, we apply bargaining theory to determine the operating point on the Pareto frontier.<\/jats:p>","DOI":"10.1145\/3648569","type":"journal-article","created":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T09:55:30Z","timestamp":1712829330000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Partial Server Pooling in Delay Systems"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8070-7724","authenticated-orcid":false,"given":"V Hari","family":"Rohit","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9176-2265","authenticated-orcid":false,"given":"Akshay","family":"Mete","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University System, College Station, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7302-284X","authenticated-orcid":false,"given":"D","family":"Manjunath","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3849-8858","authenticated-orcid":false,"given":"Jayakrishnan","family":"Nair","sequence":"additional","affiliation":[{"name":"IIT Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1655-9215","authenticated-orcid":false,"given":"Balakrishna","family":"Prabhu","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,21]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1287\/opre.1090.0737","article-title":"Cooperation in service systems","volume":"58","author":"Anily S.","year":"2010","unstructured":"S. Anily and M. Haviv. 2010. Cooperation in service systems. Operat. Res. 58, 3 (2010), 660\u2013673.","journal-title":"Operat. Res."},{"key":"e_1_3_3_3_2","doi-asserted-by":"crossref","unstructured":"U. Ayesta T. Bodas and I. Verloop. 2018. On a unifying product form framework for redundancy models. Perf. Eval. 127\u2013128 (2018) 93\u2013119.","DOI":"10.1016\/j.peva.2018.09.008"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00155-6"},{"key":"e_1_3_3_5_2","unstructured":"E. Brockmeyer H. Halstrom and A. Jensen. 1948. Life and works of A.K. Erlang. Trans. Dan. Acad. Techn. Sci. (1948)."},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(90)90004-3"},{"key":"e_1_3_3_7_2","doi-asserted-by":"crossref","unstructured":"K. Gardner M. Harchol-Balter E. Hyytia and R. Righter. 2017. Scheduling for efficiency and fairness in systems with redundancy. Perf. Eval. 116 (2017) 1\u201325.","DOI":"10.1016\/j.peva.2017.07.001"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s001860400350"},{"key":"e_1_3_3_9_2","volume-title":"Performance Modeling and Design of Computer Systems","author":"Harchol-Balter M.","unstructured":"M. Harchol-Balter. 2013. Performance Modeling and Design of Computer Systems, 1st ed. Cambridge University Press.","edition":"1"},{"key":"e_1_3_3_10_2","first-page":"1102","article-title":"Call-center labor cross-training: It\u2019s a small world after all. Manage","volume":"53","author":"Iravani S. M. R.","year":"2007","unstructured":"S. M. R. Iravani, B. Kolfal, and M. P. V. Oyen. 2007. Call-center labor cross-training: It\u2019s a small world after all. Manage. Sci. 53, 7 (2007), 1102\u20131112.","journal-title":"Sci."},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.2307\/1914280"},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/opre.2015.1360","article-title":"Resource pooling and cost allocation among independent service providers","volume":"63","author":"Karsten F.","year":"2015","unstructured":"F. Karsten, M. Slikker, and G.-J. V. Houtum. 2015. Resource pooling and cost allocation among independent service providers. Operat. Res. 63, 2 (2015), 476\u2013488.","journal-title":"Operat. Res."},{"key":"e_1_3_3_13_2","series-title":"International Series in Operations Research & Management Science 154","volume-title":"Order independent queues","author":"Krzesinski A.","year":"2011","unstructured":"A. Krzesinski. 2011. Order independent queues. International Series in Operations Research & Management Science 154, (2011), 85\u2013120."},{"volume-title":"Proceedings of the 6th Southern African Computer Symposium, 69\u201382","author":"Krzesinski A.","key":"e_1_3_3_14_2","unstructured":"A. Krzesinski and R. Schassberger. 1991. Product form solutions for multiserver centres with heirarchical classes of customers. In Proceedings of the 6th Southern African Computer Symposium, 69\u201382."},{"volume-title":"Order Independent Queues","author":"Krzesinski A. E.","key":"e_1_3_3_15_2","unstructured":"A. E. Krzesinski. 2011. Order Independent Queues. Springer US, Boston, MA, 85\u2013120."},{"volume-title":"Proceedings of the International Teletraffic Congress (ITC\u201919)","author":"Mete A.","key":"e_1_3_3_16_2","unstructured":"A. Mete, D. Manjunath, J. Nair, and B. Prabhu. 2019. Partial server pooling in redundancy systems. In Proceedings of the International Teletraffic Congress (ITC\u201919)."},{"volume-title":"Game Theory","author":"Myerson R. B.","key":"e_1_3_3_17_2","unstructured":"R. B. Myerson. 2013. Game Theory. Harvard University Press."},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2918164"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-011-9274-6"},{"key":"e_1_3_3_20_2","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1287\/msom.1050.0086","article-title":"A staffing algorithm for call centers with skill-based routing","volume":"7","author":"Wallace R. B.","year":"2005","unstructured":"R. B. Wallace and W. Whitt. 2005. A staffing algorithm for call centers with skill-based routing. Manufact. Serv. Operat. Manage. 7, 4 (2005), 276\u2013294.","journal-title":"Manufact. Serv. Operat. Manage."}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3648569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3648569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:20Z","timestamp":1750287020000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3648569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,21]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1145\/3648569"],"URL":"https:\/\/doi.org\/10.1145\/3648569","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"type":"print","value":"2376-3639"},{"type":"electronic","value":"2376-3647"}],"subject":[],"published":{"date-parts":[[2024,5,21]]},"assertion":[{"value":"2021-12-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-03","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}