{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:49:04Z","timestamp":1774554544026,"version":"3.50.1"},"reference-count":96,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"name":"NSF &#x28;National Science Foundation&#x29;","award":["CNS-2148128"],"award-info":[{"award-number":["CNS-2148128"]}]},{"name":"NSF &#x28;National Science Foundation&#x29;","award":["CNS-2148183"],"award-info":[{"award-number":["CNS-2148183"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2026,3,26]]},"abstract":"<jats:p>Stochastic Network Utility Maximization (NUM) has been a dominant framework for many queueing network resource allocation and control problems. Its original model seeks to optimize social welfare, which usually takes the form of the sum of local utilities of participating entities. However, such a centralized utility maximization approach is unsuitable for many modern multi-agent systems, in which each agent may selfishly optimize its local utility without regard to the overall utility. In this paper, we formulate the stochastic NUM problem in strategic queueing systems as a repeated game with queue stability constraints. In particular, the agents repeatedly make decisions to satisfy both their local constraints and global constraints, shared among them, while maintaining queue stability. The goal is to design a policy that constitutes a generalized Nash equilibrium (GNE) for the game.<\/jats:p>\n                  <jats:p>\n                    We first derive the fluid model characterization of the strategic queueing NUM problem via a static one-shot game formulation. This characterization motivates a primal-dual algorithm that constitutes an approximate GNE by ensuring last-iterate convergence to a solution of the regularized static one-shot game. However, similar to primal-dual methods developed for the classical NUM problem, this approach does not leverage real-time queue lengths in decision making, leading to suboptimal queueing delay in practice, and has no explicit performance guarantees. To this end, we propose the Strategic Drift-plus-Penalty (SDP) algorithm and show that it constitutes an \u03b5-GNE and has a uniformly bounded expected queue length of order\n                    <jats:italic toggle=\"yes\">O<\/jats:italic>\n                    (1\/\u03b5\n                    <jats:sup>3<\/jats:sup>\n                    ) for any \u03b5 &gt; 0. Under an additional mild assumption that holds for a wide class of problems, we show that our algorithms achieve long-term average social welfare arbitrarily close to that of a welfare-maximizing GNE policy. Simulations validate our theory and demonstrate the favorable performance of our algorithms.\n                  <\/jats:p>","DOI":"10.1145\/3788103","type":"journal-article","created":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T18:49:47Z","timestamp":1774550987000},"page":"1-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic Network Utility Maximization in Strategic Queueing Systems: A Game-Theoretic Approach"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5817-9769","authenticated-orcid":false,"given":"Quang Minh","family":"Nguyen","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1861-6722","authenticated-orcid":false,"given":"Randall","family":"Berry","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8238-8130","authenticated-orcid":false,"given":"Eytan","family":"Modiano","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,3,26]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2015. Amendment of the Commission's Rules with Regard to Commercial Operations in the 3550-3650 MHz Band. Technical Report FCC 15-47. Federal Communications Commission. https:\/\/docs.fcc.gov\/public\/attachments\/FCC-15-47A1.pdf Report and Order and Second Further Notice of Proposed Rulemaking."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2002.1184680"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-8176-4429-6_26"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832557"},{"key":"e_1_2_1_5_1","unstructured":"Amazon Web Services. 2025. Amazon EC2 - Elastic Compute Cloud. http:\/\/aws.amazon.com\/ec2\/."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963433"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3123207"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/110821317"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3384334"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050083"},{"key":"e_1_2_1_11_1","volume-title":"Combettes","author":"Bauschke Heinz H.","year":"2017","unstructured":"Heinz H. Bauschke and Patrick L. Combettes. 2017. Convex Analysis and Monotone Operator Theory in Hilbert Spaces (2nd ed.). Springer Publishing Company, Incorporated."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2018.8550342"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC49753.2023.10383583"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Randall Berry Thomas W. Hazlett Michael Honig and J. Nicholas Laneman. 2023. Evaluating the CBRS Experiment. http:\/\/dx.doi.org\/10.2139\/ssrn.4528763 Available at SSRN: https:\/\/ssrn.com\/abstract=4528763.","DOI":"10.2139\/ssrn.4528763"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2019.3437"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/378570.378633"},{"key":"e_1_2_1_17_1","volume-title":"Convex Optimization","author":"Boyd Stephen","unstructured":"Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. Cambridge University Press."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0500"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.07.014"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887322"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467047"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2012.733883"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.02.015"},{"key":"e_1_2_1_24_1","volume-title":"Pricing Communication Networks: Economics","author":"Courcoubetis Costas","unstructured":"Costas Courcoubetis and Richard Weber. 2003. Pricing Communication Networks: Economics, Technology and Modelling (Wiley Interscience Series in Systems and Optimization). John Wiley & Sons, Inc., Hoboken, NJ, USA."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of Thirty Sixth Conference on Learning Theory (Proceedings of Machine Learning Research","volume":"4234","author":"Daskalakis Constantinos","year":"2023","unstructured":"Constantinos Daskalakis, Noah Golowich, and Kaiqing Zhang. 2023. The Complexity of Markov Equilibrium in Stochastic Games. In Proceedings of Thirty Sixth Conference on Learning Theory (Proceedings of Machine Learning Research, Vol. 195), Gergely Neu and Lorenzo Rosasco (Eds.). PMLR, 4180-4234. https:\/\/proceedings.mlr.press\/v195\/daskalakis23a.html"},{"key":"e_1_2_1_27_1","volume-title":"Efficiency Guarantees in Auctions with Budgets","author":"Dobzinski Shahar","unstructured":"Shahar Dobzinski and Renato Paes Leme. 2014. Efficiency Guarantees in Auctions with Budgets. In Automata, Languages, and Programming, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 392-404."},{"key":"e_1_2_1_28_1","volume-title":"A Nash equilibrium approach for multiobjective optimal control problems with elliptic partial differential equations. Control and cybernetics 45 (01","author":"Dreves Axel","year":"2016","unstructured":"Axel Dreves. 2016. A Nash equilibrium approach for multiobjective optimal control problems with elliptic partial differential equations. Control and cybernetics 45 (01 2016), 457-482."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1327-0"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.03.004"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-007-0054-4"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/090749499"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21814-4_3"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.23919\/ECC51009.2020.9143966"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.110101"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2021.102229"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3570619"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3015354"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399491"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3587250"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2333660.2333724"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2904080"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.826001"},{"key":"e_1_2_1_44_1","unstructured":"Google Cloud Platform. 2025. Google App Engine - Build and host applications on Google's infrastructure. https:\/\/cloud.google.com\/appengine."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892237744"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2445789"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-24273-2_2"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2107502.2107531"},{"key":"e_1_2_1_49_1","unstructured":"IBM Cloud. 2025. IBM Cloud - Cloud Computing Services & Solutions. https:\/\/www.ibm.com\/cloud."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2722999"},{"key":"e_1_2_1_51_1","unstructured":"Ankur A. Kulkarni. 2019. The Efficiency of Generalized Nash and Variational Equilibria. arXiv:1908.00702 [cs.GT] https:\/\/arxiv.org\/abs\/1908.00702"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2011.09.042"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.815014"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.272"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879351"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton49937.2022.9929348"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3307684"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195815"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2301613"},{"key":"e_1_2_1_60_1","unstructured":"Microsoft Azure. 2025. Microsoft Azure - Cloud Computing Platform. https:\/\/azure.microsoft.com\/en-us\/."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/DySPAN60163.2024.10632777"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/DySPAN53946.2021.9677426"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2014.02.008"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903141"},{"key":"e_1_2_1_66_1","unstructured":"Michael J. Neely. 2010. Stability and Capacity Regions or Discrete Time Queueing Networks. arXiv:1003.3396 [cs.NI] https:\/\/arxiv.org\/abs\/1003.3396"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.5555\/1941130"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2191157"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736645"},{"key":"e_1_2_1_70_1","unstructured":"Michael J. Neely. 2014. A Simple Convergence Time Analysis of Drift-Plus-Penalty for Stochastic Optimization and Convex Programs. arXiv:1412.0791 [math.OC] https:\/\/arxiv.org\/abs\/1412.0791"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2449323"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900405"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3744970.3727287"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/TON.2025.3560605"},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Quang Minh Nguyen and Eytan Modiano. 2025. A QoS Framework for Service Provision in Multi-Infrastructure-Sharing Networks. arXiv:2509.01694 [cs.NI]","DOI":"10.1145\/3704413.3764414"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton63246.2024.10735302"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM55135.2022.10017713"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2480418"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879350"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10287-004-0010-0"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2922953"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(01)00276-X"},{"key":"e_1_2_1_83_1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/S0002-9947-1970-0282272-5","article-title":"On the Maximality of Sums of Nonlinear Monotone","volume":"149","author":"Rockafellar R. T.","year":"1970","unstructured":"R. T. Rockafellar. 1970. On the Maximality of Sums of Nonlinear Monotone Operators. Trans. Amer. Math. Soc. 149, 1 (1970), 75-88. http:\/\/www.jstor.org\/stable\/1995660","journal-title":"Operators. Trans. Amer. Math. Soc."},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195812"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS50987.2021.9400240"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2021.08.001"},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.23919\/WIOPT.2018.8362817"},{"key":"e_1_2_1_88_1","volume-title":"Network Formation Games and the Potential Function Method","author":"Tardos \u00c9va","unstructured":"\u00c9va Tardos and Tom Wexler. 2007. Network Formation Games and the Potential Function Method. Cambridge University Press, 487-516."},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2486770"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9145-6"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447385"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0318-1"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8264224"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2695451"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2844284"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.3044870"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3788103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T18:50:16Z","timestamp":1774551016000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3788103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,26]]},"references-count":96,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,26]]}},"alternative-id":["10.1145\/3788103"],"URL":"https:\/\/doi.org\/10.1145\/3788103","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,26]]},"assertion":[{"value":"2026-03-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}