{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/936b8ae1-6c3c-4e07-b154-8625632d0672\" width=\"1280\" height=\"720\" title=\"Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs — Paper Radio\" frameborder=\"0\" allow=\"autoplay; fullscreen; picture-in-picture\" allowfullscreen loading=\"lazy\" style=\"border:0;display:block;max-width:100%;\"></iframe>","provider_name":"Paper Radio","provider_url":"https://m.montaan.com/","thumbnail_url":"https://m.montaan.com/media/episodes/936b8ae1-6c3c-4e07-b154-8625632d0672/episode.poster.webp","title":"Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs","type":"video","version":"1.0","width":1280}