资源分类
》 资源 》论文》When are Kalman-Filter Restless Bandits Indexable?

When are Kalman-Filter Restless Bandits Indexable?

2020-02-04 | |  78 |   45 |   0

Abstract 

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.

上一篇：Lifelong Learning with Non-i.i.d. Tasks

下一篇：COEVOLVE: A Joint Point Process Model for Information Diffusion and Network Co-evolution

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...