arXiv Open Access 2015

When are Kalman-filter restless bandits indexable?

Christopher R. Dance Tomi Silander

Lihat Sumber

Abstrak

We study the restless bandit associated with an extremely simple scalar Kalman filter model in discrete time. Under certain assumptions, we prove that the problem is indexable in the sense that the Whittle index is a non-decreasing function of the relevant belief state. In spite of the long history of this problem, this appears to be the first such proof. We use results about Schur-convexity and mechanical words, which are particular binary strings intimately related to palindromes.

Topik & Kata Kunci

stat.ML

Penulis (2)

Christopher R. Dance

Tomi Silander

Format Sitasi

APA MLA BibTeX

Dance, C.R., Silander, T. (2015). When are Kalman-filter restless bandits indexable?. https://arxiv.org/abs/1509.04541

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓