Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs
arXiv:2509.16586v2 Announce Type: replace Abstract: Recent advances have significantly improved our understanding of the sample complexity of learning in average-reward Markov decision processes (AMDP