Achieving $\tilde{O}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation

Yan, Chen; Wang, Weina; Ying, Lei

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 5:00 PM ET until 8:00 PM ET on Friday, September 11 due to maintenance. We apologize for the inconvenience.

Citation Details

This content will become publicly available on December 4, 2026

Achieving $\tilde{O}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation

Award ID(s):: 2145713 2403194 2428569 2432545

PAR ID:: 10674396

Author(s) / Creator(s):: Yan, Chen; Wang, Weina; Ying, Lei

Publisher / Repository:: NeurIPS 2025

Date Published:: 2025-12-04

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on December 4, 2026
Conference Paper:
The DOI is not currently available.

More Like this