IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v104y2023i1d10.1007_s11134-023-09875-x.html
   My bibliography  Save this article

Exponential asymptotic optimality of Whittle index policy

Author

Listed:
  • Nicolas Gast

    (Univ. Grenoble Alpes)

  • Bruno Gaujal

    (Univ. Grenoble Alpes)

  • Chen Yan

    (Univ. Grenoble Alpes)

Abstract

We evaluate the performance of Whittle index policy for restless Markovian bandit. It is shown in Weber and Weiss (J Appl Probab 27(3):637–648, 1990) that if the bandit is indexable and the associated deterministic system has a global attractor fixed point, then the Whittle index policy is asymptotically optimal in the regime where the arm population grows proportionally with the number of activation arms. In this paper, we show that, under the same conditions, this convergence rate is exponential in the arm population, unless the fixed point is singular (to be defined later), which almost never happens in practice. Our result holds for the continuous-time model of Weber and Weiss (1990) and for a discrete-time model in which all bandits make synchronous transitions. Our proof is based on the nature of the deterministic equation governing the stochastic system: We show that it is a piecewise affine continuous dynamical system inside the simplex of the empirical measure of the arms. Using simulations and numerical solvers, we also investigate the singular cases, as well as how the level of singularity influences the (exponential) convergence rate. We illustrate our theorem on a Markovian fading channel model.

Suggested Citation

  • Nicolas Gast & Bruno Gaujal & Chen Yan, 2023. "Exponential asymptotic optimality of Whittle index policy," Queueing Systems: Theory and Applications, Springer, vol. 104(1), pages 107-150, June.
    • Handle: RePEc:spr:queues:v:104:y:2023:i:1:d:10.1007_s11134-023-09875-x
    DOI: 10.1007/s11134-023-09875-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-023-09875-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-023-09875-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kurtz, Thomas G., 1978. "Strong approximation theorems for density dependent Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 6(3), pages 223-240, February.
    2. David B. Brown & James E. Smith, 2020. "Index Policies and Performance Bounds for Dynamic Selection Problems," Management Science, INFORMS, vol. 66(7), pages 3029-3050, July.
    3. P. S. Ansell & K. D. Glazebrook & J. Niño-Mora & M. O'Keeffe, 2003. "Whittle's index policy for a multi-class queueing system with convex holding costs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 57(1), pages 21-39, April.
    Full references (including those not matched with items on IDEAS)

    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. José Niño-Mora, 2023. "Markovian Restless Bandits and Index Policies: A Review," Mathematics, MDPI, vol. 11(7), pages 1-27, March.
    2. José Niño-Mora, 2006. "Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 50-84, February.
    3. Santiago R. Balseiro & David B. Brown & Chen Chen, 2021. "Dynamic Pricing of Relocating Resources in Large Networks," Management Science, INFORMS, vol. 67(7), pages 4075-4094, July.
    4. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    5. Davide Crapis & Bar Ifrach & Costis Maglaras & Marco Scarsini, 2017. "Monopoly Pricing in the Presence of Social Learning," Management Science, INFORMS, vol. 63(11), pages 3586-3608, November.
    6. Ankit Gupta & Mustafa Khammash, 2022. "Frequency spectra and the color of cellular noise," Nature Communications, Nature, vol. 13(1), pages 1-18, December.
    7. Deligiannis, Michalis & Liberopoulos, George, 2023. "Dynamic ordering and buyer selection policies when service affects future demand," Omega, Elsevier, vol. 118(C).
    8. Keliger, Dániel & Horváth, Illés, 2023. "Accuracy criterion for mean field approximations of Markov processes on hypergraphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    9. Jamaal Ahmad & Mogens Bladt, 2022. "Phase-type representations of stochastic interest rates with applications to life insurance," Papers 2207.11292, arXiv.org, revised Nov 2022.
    10. He, Yuheng & Xue, Xiaofeng, 2023. "Moderate deviations of hitting times of a family of density-dependent Markov chains," Statistics & Probability Letters, Elsevier, vol. 195(C).
    11. Lücke, Marvin & Heitzig, Jobst & Koltai, Péter & Molkenthin, Nora & Winkelmann, Stefanie, 2023. "Large population limits of Markov processes on random networks," Stochastic Processes and their Applications, Elsevier, vol. 166(C).
    12. Ramandeep S. Randhawa & Sunil Kumar, 2009. "Multiserver Loss Systems with Subscribers," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 142-179, February.
    13. Nicolas Gast & Bruno Gaujal & Kimang Khun, 2023. "Testing indexability and computing Whittle and Gittins index in subcubic time," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 391-436, June.
    14. S. Duran & U. Ayesta & I. M. Verloop, 2022. "On the Whittle index of Markov modulated restless bandits," Queueing Systems: Theory and Applications, Springer, vol. 102(3), pages 373-430, December.
    15. L Ding & K D Glazebrook, 2005. "A static allocation model for the outsourcing of warranty repairs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(7), pages 825-835, July.
    16. Jamol Pender & Richard Rand & Elizabeth Wesson, 2020. "A Stochastic Analysis of Queues with Customer Choice and Delayed Information," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 1104-1126, August.
    17. Sun, Bo & Sun, Xu & Tsang, Danny H.K. & Whitt, Ward, 2019. "Optimal battery purchasing and charging strategy at electric vehicle battery swap stations," European Journal of Operational Research, Elsevier, vol. 279(2), pages 524-539.
    18. Ece Zeliha Demirci & Joachim Arts & Geert-Jan Van Houtum, 2022. "A restless bandit approach for capacitated condition based maintenance scheduling," DEM Discussion Paper Series 22-01, Department of Economics at the University of Luxembourg.
    19. Sarang Deo & Seyed Iravani & Tingting Jiang & Karen Smilowitz & Stephen Samuelson, 2013. "Improving Health Outcomes Through Better Capacity Allocation in a Community-Based Chronic Care Model," Operations Research, INFORMS, vol. 61(6), pages 1277-1294, December.
    20. Michelle Opp & Kevin Glazebrook & Vidyadhar G. Kulkarni, 2005. "Outsourcing warranty repairs: Dynamic allocation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 381-398, August.

    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:queues:v:104:y:2023:i:1:d:10.1007_s11134-023-09875-x. 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: 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.