Unichain and Aperiodicity Are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits
- Yige Hong ,
Corresponding Author
Yige Hong
[email protected]https://orcid.org/0000-0001-8534-1063
Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
- Qiaomin Xie ,
Qiaomin Xie
[email protected]https://orcid.org/0000-0003-2834-6866
Department of Industrial and Systems Engineering, University of Wisconsin–Madison, Madison, Wisconsin 53706
- Yudong Chen ,
Yudong Chen
[email protected]https://orcid.org/0000-0002-6416-5635
Department of Computer Sciences, University of Wisconsin–Madison, Madison, Wisconsin 53706
- Weina Wang
Weina Wang
[email protected]https://orcid.org/0000-0001-6808-0156
Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
Corresponding Author
Yige Hong
[email protected]https://orcid.org/0000-0001-8534-1063
Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
Qiaomin Xie
[email protected]https://orcid.org/0000-0003-2834-6866
Department of Industrial and Systems Engineering, University of Wisconsin–Madison, Madison, Wisconsin 53706
Yudong Chen
[email protected]https://orcid.org/0000-0002-6416-5635
Department of Computer Sciences, University of Wisconsin–Madison, Madison, Wisconsin 53706
Weina Wang
[email protected]https://orcid.org/0000-0001-6808-0156
Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213

