Near-optimal Per-Action Regret Bounds for Sleeping Bandits. - Quan M. Nguyen; Nishant Mehta (AISTATS, 2024)

Data-dependent Bounds with T-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching. - Quan Nguyen; Shinji Ito; Junpei Komiyama; Nishant Mehta (COLT, 2025)