Citace podle APA (7th ed.)

Liu, K., Weber, R., & Zhang, C. (2024). Low-complexity algorithm for restless bandits with imperfect observations. Mathematical methods of operations research (Heidelberg, Germany), 100(2), 467-508. https://doi.org/10.1007/s00186-024-00868-x

Citace podle Chicago (17th ed.)

Liu, Keqin, Richard Weber, a Chengzhong Zhang. "Low-complexity Algorithm for Restless Bandits with Imperfect Observations." Mathematical Methods of Operations Research (Heidelberg, Germany) 100, no. 2 (2024): 467-508. https://doi.org/10.1007/s00186-024-00868-x.

Citace podle MLA (9th ed.)

Liu, Keqin, et al. "Low-complexity Algorithm for Restless Bandits with Imperfect Observations." Mathematical Methods of Operations Research (Heidelberg, Germany), vol. 100, no. 2, 2024, pp. 467-508, https://doi.org/10.1007/s00186-024-00868-x.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..