Matteo Castiglioni

8

Papers

22

Total Citations

Papers (8)

Markov Persuasion Processes: Learning to Persuade From Scratch

NeurIPS 2025arXiv

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization

Bandits with Replenishable Knapsacks: the Best of both Worlds

Feature-Based Online Bilateral Trade

Data-Dependent Regret Bounds for Constrained MABs

NeurIPS 2025arXiv

Online Learning under Budget and ROI Constraints via Weak Adaptivity

Graph-Triggered Rising Bandits

Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints