When are Kalman-filter restless bandits indexable?

09/15/2015
by   Christopher R. Dance, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset