{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T08:23:34Z","timestamp":1775031814656,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T00:00:00Z","timestamp":1684627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T00:00:00Z","timestamp":1684627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"ANR","award":["ANR-19-CE23-0015"],"award-info":[{"award-number":["ANR-19-CE23-0015"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11134-023-09875-x","type":"journal-article","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T09:01:57Z","timestamp":1684659717000},"page":"107-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Exponential asymptotic optimality of Whittle index policy"],"prefix":"10.1007","volume":"104","author":[{"given":"Nicolas","family":"Gast","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Gaujal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0551-4786","authenticated-orcid":false,"given":"Chen","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,21]]},"reference":[{"key":"9875_CR1","doi-asserted-by":"crossref","unstructured":"Aalto, S., Lassila, P., Osti, P.: Whittle index approach to size-aware scheduling with time-varying channels. In: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 57\u201369 (2015)","DOI":"10.1145\/2745844.2745851"},{"issue":"1","key":"9875_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s001860200257","volume":"57","author":"P Ansell","year":"2003","unstructured":"Ansell, P., Glazebrook, K.D., Nino-Mora, J., et al.: Whittle\u2019s index policy for a multi-class queueing system with convex holding costs. Math. Methods Oper. Res. 57(1), 21\u201339 (2003)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"9875_CR3","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/TCNS.2016.2619066","volume":"5","author":"KE Avrachenkov","year":"2016","unstructured":"Avrachenkov, K.E., Borkar, V.S.: Whittle index policy for crawling ephemeral content. IEEE Trans. Control Netw. Syst. 5(1), 446\u2013455 (2016)","journal-title":"IEEE Trans. Control Netw. Syst."},{"issue":"3","key":"9875_CR4","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1006\/jcss.2000.1737","volume":"62","author":"VD Blondel","year":"2001","unstructured":"Blondel, V.D., Bournez, O., Koiran, P., et al.: The stability of saturated linear dynamical systems is undecidable. J. Comput. Syst. Sci. 62(3), 442\u2013462 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"9875_CR5","doi-asserted-by":"publisher","first-page":"3029","DOI":"10.1287\/mnsc.2019.3342","volume":"66","author":"DB Brown","year":"2020","unstructured":"Brown, D.B., Smith, J.E.: Index policies and performance bounds for dynamic selection problems. Manag. Sci. 66, 3029\u20133050 (2020)","journal-title":"Manag. Sci."},{"key":"9875_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1214\/07-PS121","volume":"5","author":"R Darling","year":"2008","unstructured":"Darling, R., Norris, J.: Differential equation approximations for Markov chains. Probab. Surv. 5, 37\u201379 (2008)","journal-title":"Probab. Surv."},{"key":"9875_CR7","doi-asserted-by":"crossref","unstructured":"Duff, M.O.: Q-learning for bandit problems. In: Proceedings of the Twelfth International Conference on International Conference on Machine Learning. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, ICML\u201995, pp. 209\u2013217 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50034-7"},{"key":"9875_CR8","doi-asserted-by":"crossref","unstructured":"Duran, S., Verloop, M.: Asymptotic optimal control of markov-modulated restless bandits. In: International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2018), vol\u00a02. ACM : Association for Computing Machinery, Irvine, US, pp. 7:1\u20137:25 (2018)","DOI":"10.1145\/3179410"},{"key":"9875_CR9","doi-asserted-by":"crossref","unstructured":"Gast, N.: Expected Values Estimated via Mean-Field Approximation are 1\/N-Accurate. In: ACM SIGMETRICS\/ International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS \u201917, Urbana-Champaign, United States, p.\u00a026 (2017)","DOI":"10.1145\/3078505.3078523"},{"key":"9875_CR10","doi-asserted-by":"crossref","unstructured":"Gast, N., Van\u00a0Houdt, B.: A refined mean field approximation. In: Proceedings of the ACM on Measurement and Analysis of Computing Systems 1(28) (2017)","DOI":"10.1145\/3154491"},{"key":"9875_CR11","unstructured":"Gast, N., Bortolussi, L., Tribastone, M.: Size expansions of mean field approximation: transient and steady-state analysis. In: 2018\u201336th International Symposium on Computer Performance, Modeling, Measurements and Evaluation, Toulouse, France, pp. 1\u20132 (2018)"},{"key":"9875_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.peva.2018.05.002","volume":"126","author":"N Gast","year":"2018","unstructured":"Gast, N., Latella, D., Massink, M.: A refined mean field approximation of synchronous discrete-time population models. Perform. Eval. 126, 1\u201321 (2018)","journal-title":"Perform. Eval."},{"key":"9875_CR13","doi-asserted-by":"crossref","unstructured":"Gast, N., Gaujal, B., Khun, K.: Computing whittle (and gittins) index in subcubic time. arXiv preprint arXiv:2203.05207 (2022)","DOI":"10.1007\/s00186-023-00821-4"},{"key":"9875_CR14","doi-asserted-by":"crossref","unstructured":"Gast, N., Gaujal, B., Yan, C.: Lp-based policies for restless bandits: necessary and sufficient conditions for (exponentially fast) asymptotic optimality (2022)","DOI":"10.1287\/moor.2022.0101"},{"key":"9875_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/9780470980033","volume-title":"Multi-armed Bandit Allocation Indices","author":"J Gittins","year":"2011","unstructured":"Gittins, J., Glazebrook, K., Weber, R.: Multi-armed Bandit Allocation Indices. John Wiley & Sons, Hoboken (2011)"},{"key":"9875_CR16","doi-asserted-by":"crossref","unstructured":"Gittins, J.C.: Bandit processes and dynamic allocation indices. J. R. Stat. Soc. Ser. B 148\u2013177 (1979)","DOI":"10.1111\/j.2517-6161.1979.tb01068.x"},{"issue":"3","key":"9875_CR17","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1239\/aap\/1444308876","volume":"47","author":"DJ Hodge","year":"2015","unstructured":"Hodge, D.J., Glazebrook, K.D.: On the asymptotic optimality of greedy index heuristics for multi-action restless bandits. Adv. Appl. Probab. 47(3), 652\u2013667 (2015)","journal-title":"Adv. Appl. Probab."},{"key":"9875_CR18","unstructured":"Hu, W., Frazier, P.: An asymptotically optimal index policy for finite-horizon restless bandits (2017)"},{"key":"9875_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-8181-9","volume-title":"Random Perturbations of Dynamical Systems. Progress in Probability","author":"Y Kifer","year":"1988","unstructured":"Kifer, Y.: Random Perturbations of Dynamical Systems. Progress in Probability. Birkh\u00e4user, Boston (1988)"},{"issue":"3","key":"9875_CR20","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-4149(78)90020-0","volume":"6","author":"TG Kurtz","year":"1978","unstructured":"Kurtz, T.G.: Strong approximation theorems for density dependent Markov chains. Stoch. Process. Appl. 6(3), 223\u2013240 (1978)","journal-title":"Stoch. Process. Appl."},{"issue":"6","key":"9875_CR21","doi-asserted-by":"publisher","first-page":"3812","DOI":"10.1109\/TNET.2016.2562564","volume":"24","author":"M Larranaga","year":"2016","unstructured":"Larranaga, M., Ayesta, U., Verloop, I.M.: Dynamic control of birth-and-death restless bandits: application to resource-allocation problems. IEEE\/ACM Trans. Netw. 24(6), 3812\u20133825 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9875_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401","volume-title":"Bandit Algorithms","author":"T Lattimore","year":"2020","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press, Cambridge (2020)"},{"issue":"11","key":"9875_CR23","doi-asserted-by":"publisher","first-page":"5547","DOI":"10.1109\/TIT.2010.2068950","volume":"56","author":"K Liu","year":"2010","unstructured":"Liu, K., Zhao, Q.: Indexability of restless bandit problems and optimality of whittle index for dynamic multichannel access. IEEE Trans. Inf. Theory 56(11), 5547\u20135567 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"9875_CR24","doi-asserted-by":"publisher","first-page":"3046","DOI":"10.1109\/TAC.2018.2799521","volume":"63","author":"R Meshram","year":"2018","unstructured":"Meshram, R., Manjunath, D., Gopalan, A.: On the whittle index for restless multiarmed hidden Markov bandits. IEEE Trans. Autom. Control 63(9), 3046\u20133053 (2018)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9875_CR25","unstructured":"Ni\u00f1o-Mora, J., Villar, S.S.: Sensor scheduling for hunting elusive hiding targets via whittle\u2019s restless bandit index policy. In: International Conference on NETwork Games, Control and Optimization (NetGCooP 2011). IEEE, pp. 1\u20138 (2011)"},{"key":"9875_CR26","doi-asserted-by":"crossref","unstructured":"Ouyang, W., Eryilmaz, A., Shroff, N.B.: Asymptotically optimal downlink scheduling over Markovian fading channels. In: 2012 Proceedings IEEE INFOCOM, IEEE, pp. 1224\u20131232 (2012)","DOI":"10.1109\/INFCOM.2012.6195483"},{"key":"9875_CR27","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Tsitsiklis, J.N.: The complexity of optimal queuing network control. Math. Oper. Res. 293\u2013305 (1999)","DOI":"10.1287\/moor.24.2.293"},{"key":"9875_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1st edn. John Wiley & Sons Inc, New York (1994)","edition":"1"},{"key":"9875_CR29","doi-asserted-by":"crossref","unstructured":"Raghunathan, V., Borkar, V., Cao, M., et\u00a0al.: Index policies for real-time multicast scheduling for wireless broadcast systems. In: IEEE INFOCOM 2008-The 27th Conference on Computer Communications, IEEE, pp. 1570\u20131578 (2008)","DOI":"10.1109\/INFOCOM.2008.217"},{"issue":"4","key":"9875_CR30","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1214\/15-AAP1137","volume":"26","author":"M Verloop","year":"2016","unstructured":"Verloop, M.: Asymptotically optimal priority policies for indexable and nonindexable restless bandits. Ann. Appl. Probab. 26(4), 1947\u20131995 (2016)","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"9875_CR31","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/3214547","volume":"27","author":"RR Weber","year":"1990","unstructured":"Weber, R.R., Weiss, G.: On an index policy for restless bandits. J. Appl. Probab. 27(3), 637\u2013648 (1990)","journal-title":"J. Appl. Probab."},{"issue":"2","key":"9875_CR32","doi-asserted-by":"publisher","first-page":"429","DOI":"10.2307\/1427757","volume":"23","author":"RR Weber","year":"1991","unstructured":"Weber, R.R., Weiss, G.: Addendum to: On an index policy for restless bandits. Adv. Appl. Probab. 23(2), 429\u2013430 (1991)","journal-title":"Adv. Appl. Probab."},{"key":"9875_CR33","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2307\/3214163","volume":"25A","author":"P Whittle","year":"1988","unstructured":"Whittle, P.: Restless bandits: activity allocation in a changing world. J. Appl. Probab. 25A, 287\u2013298 (1988)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"9875_CR34","first-page":"1","volume":"1","author":"L Ying","year":"2017","unstructured":"Ying, L.: Stein\u2019s method for mean field approximations in light and heavy traffic regimes. POMACS 1(1), 1\u201327 (2017)","journal-title":"POMACS"},{"issue":"3","key":"9875_CR35","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1017\/apr.2019.29","volume":"51","author":"G Zayas-Caban","year":"2019","unstructured":"Zayas-Caban, G., Jasin, S., Wang, G.: An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits. Adv. Appl. Probab. 51(3), 745\u2013772 (2019)","journal-title":"Adv. Appl. Probab."},{"key":"9875_CR36","unstructured":"Zhang, X., Frazier, P.I.: Restless bandits with many arms: beating the central limit theorem (2021)"},{"key":"9875_CR37","unstructured":"Zhang, X., Frazier, P.I.: Near-optimality for infinite-horizon restless bandits with many arms. arXiv preprint arXiv:2203.15853 (2022)"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-023-09875-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-023-09875-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-023-09875-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T13:47:04Z","timestamp":1702475224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-023-09875-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,21]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9875"],"URL":"https:\/\/doi.org\/10.1007\/s11134-023-09875-x","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,21]]},"assertion":[{"value":"25 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}