When are Kalman-Filter Restless Bandits Indexable?
Authors: Christopher R. Dance, Tomi Silander
NeurIPS 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | 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. |
| Researcher Affiliation | Industry | Christopher Dance and Tomi Silander Xerox Research Centre Europe 6 chemin de Maupertuis, Meylan, Is ere, France {dance,silander}@xrce.xerox.com |
| Pseudocode | No | The paper contains mathematical definitions and proofs but no structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not mention any release of open-source code. |
| Open Datasets | No | The paper is theoretical and does not use or refer to any empirical datasets, training data, or their public availability. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments or dataset splits for validation. |
| Hardware Specification | No | The paper is theoretical and does not mention any hardware specifications used for experiments. |
| Software Dependencies | No | The paper is theoretical and does not list any software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details or hyperparameters. |