On Optimality of Myopic Policy for Restless Multi-armed Bandit Problem with Non i.i.d. Arms and Imperfect Detection
Laboratoire de Recherche en Informatique (LRI), Department of Computer Science, the University of Paris-Sud XI(巴黎南第十一大学计算机科学与信息研究实验室);school of Information Engineering, Wuhan University of Technology(武汉理工大学信息工程学院)
We consider the channel access problem in a multi-channel opportunistic communication system with imperfect channel sensing, where the state of each channel evolves as a non independent and identically distributed Markov process. This problem can be cast into a restless multi-armed bandit (RMAB) problem that is intractable for its exponential computation complexity. A natural alternative is to consider the easily implementable myopic policy that maximizes the immediate reward but ignores the impact of the current strategy on the future reward. In particular, we develop three axioms characterizing a family of generic and practically important functions termed as $g$-regular functions which includes a wide spectrum of utility functions in engineering. By pursuing a mathematical analysis based on the axioms, we establish a set of closed-form structural conditions for the optimality of myopic policy.
Lagrangian Relaxation for Multi-Action Partially Observable Restless Bandits: Heuristic Policies and Indexability
Department of Electrical Engineering, Indian Institute of Technology Madras(印度理工学院马德拉斯分校电子工程系);Department of Electrical Engineering and Computer Science, University of Ottawa(渥太华大学电子工程与计算机科学系)
Restless Multi-Process Multi-Armed Bandits with Applications to Self-Driving Microscopies
Department of Information Science and Engineering(信息科学与工程系);Department of Applied Physics(应用物理系);Department of Biophysics(生物物理系);KTH Royal Institute of Technology(皇家理工学院)
The Non-Bayesian Restless Multi-Armed Bandit: A Case of Near-Logarithmic Strict Regret
Department of Aeronautics;Astronautics Massachusetts Institute of Technology, Cambridge, MA 02139, USA Ming Hsieh Department of Electrical Engineering University of Southern California, Los Angeles, CA 90089, USA Department of Electrical;Computer Engineering University of California, Davis, CA 95616, USA Email
Optimal Threshold Type Policies for Partially Observable Restless Bandits
Department of Electrical Engineering, Indian Institute of Technology Madras(印度马德拉斯理工学院电气工程系);Indian Institute of Information Technology, Allahabad(印度安拉阿巴德信息科技学院)
Constrained Restless Bandits for Dynamic Scheduling in Cyber-Physical Systems
Department of Electrical Engineering, Indian Institute of Technology Bombay(印度理工学院班加罗尔电子工程系);Polytechnique Montreal(蒙特利尔理工学院);IIIT Allahabad(阿哈迈德纳巴德印度理工学院);University of Ottawa(渥太华大学);IIT Bombay(印度理工学院班加罗尔)