Cover Image

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Germano, Jacopo, Stradi, Francesco Emanuele, Genalti, Gianmarco, Castiglioni, Matteo, Marchesi, Alberto, Gatti, Nicola
Format:	Preprint
Published:	2023
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Data-Dependent Regret Bounds for Constrained MABs
by: Genalti, Gianmarco, et al.
Published: (2025)

Learning Adversarial MDPs with Stochastic Hard Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Replicable Constrained Bandits
by: Bollini, Matteo, et al.
Published: (2026)

Truly Adapting to Adversarial Constraints in Constrained MABs
by: Stradi, Francesco Emanuele, et al.
Published: (2026)

Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
by: Stradi, Francesco Emanuele, et al.
Published: (2025)

Beyond Slater's Condition in Online CMDPs with Stochastic and Adversarial Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2025)

Multi-Armed Bandits With Best-Action Queries
by: Bacchiocchi, Francesco, et al.
Published: (2026)

Markov Persuasion Processes: Learning to Persuade from Scratch
by: Bacchiocchi, Francesco, et al.
Published: (2024)

Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time
by: Kalupahana, Kalana, et al.
Published: (2026)

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting
by: Genalti, Gianmarco, et al.
Published: (2024)

Learning Optimal Contracts: How to Exploit Small Action Spaces
by: Bacchiocchi, Francesco, et al.
Published: (2023)

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
by: Bacchiocchi, Francesco, et al.
Published: (2025)

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2025)

$(ε, u)$-Adaptive Regret Minimization in Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2023)

Online Resource Allocation With General Constraints
by: Chiefari, Eleonora Fidelia, et al.
Published: (2026)

Autoregressive Bandits
by: Bacchiocchi, Francesco, et al.
Published: (2022)

A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Safe Online Bid Optimization with Return on Investment and Budget Constraints
by: Castiglioni, Matteo, et al.
Published: (2022)

Contract Design Under Approximate Best Responses
by: Bacchiocchi, Francesco, et al.
Published: (2025)

The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms
by: Castiglioni, Matteo, et al.
Published: (2026)

Constrained Phi-Equilibria
by: Bernasconi, Martino, et al.
Published: (2023)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)

Online Packet Scheduling with Deadlines and Learning
by: Genalti, Gianmarco, et al.
Published: (2026)

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
by: Lunghi, Anna, et al.
Published: (2025)

Regret Minimization in Bilateral Trade With Perturbed Markets
by: Lunghi, Anna, et al.
Published: (2026)

Learning in Bayesian Stackelberg Games With Unknown Follower's Types
by: Bollini, Matteo, et al.
Published: (2026)

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits
by: Li, Mengmeng, et al.
Published: (2025)

The Sample Complexity of Stackelberg Games
by: Bacchiocchi, Francesco, et al.
Published: (2024)

Contracting With a Reinforcement Learning Agent by Playing Trick or Treat
by: Bollini, Matteo, et al.
Published: (2024)

Online Bayesian Persuasion Without a Clue
by: Bacchiocchi, Francesco, et al.
Published: (2024)

A Best-of-Both-Worlds Proof for Tsallis-INF without Fenchel Conjugates
by: Lee, Wei-Cheng, et al.
Published: (2025)

uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs
by: Chen, Yu, et al.
Published: (2024)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)

The Best of Both Worlds: On the Dilemma of Out-of-distribution Detection
by: Zhang, Qingyang, et al.
Published: (2024)

A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for $m$-Set Semi-Bandit Problem
by: Chen, Botao, et al.
Published: (2026)

Best-of-Both Worlds for linear contextual bandits with paid observations
by: Boyer, Nathan, et al.
Published: (2025)

Best-of-Both-Worlds for Heavy-Tailed Markov Decision Processes
by: Chen, Yu, et al.
Published: (2026)