Low-complexity algorithm for restless bandits with imperfect observations
Crossref DOI link: https://doi.org/10.1007/s00186-024-00868-x
Published Online: 2024-09-05
Published Print: 2024-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Liu, Keqin https://orcid.org/0000-0002-4783-346X
Weber, Richard
Zhang, Chengzhong
Text and Data Mining valid from 2024-09-05
Version of Record valid from 2024-09-05
Article History
Received: 16 October 2023
Revised: 4 June 2024
Accepted: 7 June 2024
First Online: 5 September 2024
Declarations
:
: The authors declare that they have no conflict of interest.
: Not applicable.
: Yes.