Skip to content
Sagan

Paper

Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs

Unreadunread

AI summary

arXiv:2606. 14095v1 Announce Type: new Abstract: We study the sample complexity of learning in average-reward weakly-coupled Markov decision processes (WCMDPs) and Restless Bandits (RBs) under a generative model.