Conditions for indexability of restless bandits and an algorithm to compute whittle index – CORRIGENDUM

DOI10.1017/APR.2022.77OpenAlexW4380088575MaRDI QIDQ6198075

Nima Akbarzadeh, Aditya Mahajan

Publication date: 20 February 2024

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/apr.2022.77

zbMATH Keywords

resource allocationstochastic schedulingWhittle indexmulti-armed banditsrestless banditsindexability

Mathematics Subject Classification ID

Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Numerical methods of relaxation type (49M20)

Cites Work

• Conditions for indexability of restless bandits and an algorithm to compute Whittle index

This page was built for publication: Conditions for indexability of restless bandits and an algorithm to compute whittle index – CORRIGENDUM