PPaperPicks

Nicola Gatti

Polytechnic University of Milan, Italy

23 papers at tracked venues · 16 at CORE A* · active 2024–2026

DBLP profile ↗ORCID 0000-0001-7349-3932 ↗Google Scholar ↗Homepage ↗

Venues

NeurIPS ×6ICML ×5ICLR ×3AISTATS ×2COLT ×2IJCAI ×2AAAI ×1AAMAS ×1SIGKDD ×1

Frequent coauthors

Francesco Emanuele Stradi
DBLP profile ↗ORCID search ↗
×7
Francesco Bacchiocchi
DBLP profile ↗ORCID search ↗
×7
Gianmarco Genalti
DBLP profile ↗ORCID search ↗
×4
Matteo Castiglioni
DBLP profile ↗ORCID search ↗
×2
Davide Maran
DBLP profile ↗ORCID search ↗
×2
Federico Cacciamani
DBLP profile ↗ORCID search ↗
×1

Papers

  1. Truly Adapting to Adversarial Constraints in Constrained MABs
    COLT 2026 ·
    Francesco Emanuele Stradi
    DBLP profile ↗ORCID search ↗
  2. Contract Design Under Approximate Best Responses
    ICML 2025 ·
    Francesco Bacchiocchi
    DBLP profile ↗ORCID search ↗
  3. Data-Dependent Regret Bounds for Constrained MABs
    NeurIPS 2025 ·
    Gianmarco Genalti
    DBLP profile ↗ORCID search ↗
  4. Learning Adversarial MDPs with Stochastic Hard Constraints
    ICML 2025 ·
    Francesco Emanuele Stradi
    DBLP profile ↗ORCID search ↗
  5. Markov Persuasion Processes: Learning to Persuade From Scratch
    NeurIPS 2025 ·
    Francesco Bacchiocchi
    DBLP profile ↗ORCID search ↗
  6. No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
    NeurIPS 2025 ·
    Francesco Emanuele Stradi
    DBLP profile ↗ORCID search ↗
  7. Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
    ICLR 2025 ·
    Francesco Emanuele Stradi
    DBLP profile ↗ORCID search ↗
  8. Policy Optimization for CMDPs with Bandit Feedback: Learning Stochastic and Adversarial Constraints
    ICML 2025 ·
    Francesco Emanuele Stradi
    DBLP profile ↗ORCID search ↗
  9. Safe Online Bid Optimization with Return on Investment and Budget Constraints
    SIGKDD 2025 ·
    Matteo Castiglioni
    DBLP profile ↗ORCID search ↗
  10. Taming Adversarial Constraints in CMDPs
    NeurIPS 2025 ·
    Francesco Emanuele Stradi
    DBLP profile ↗ORCID search ↗
  11. The Sample Complexity of Stackelberg Games
    AISTATS 2025 ·
    Francesco Bacchiocchi
    DBLP profile ↗ORCID search ↗
  12. (ε, u)-Adaptive Regret Minimization in Heavy-Tailed Bandits
    COLT 2024 ·
    Gianmarco Genalti
    DBLP profile ↗ORCID search ↗
  13. Autoregressive Bandits
    AISTATS 2024 ·
    Francesco Bacchiocchi
    DBLP profile ↗ORCID search ↗
  14. Bandits with Ranking Feedback
    NeurIPS 2024 ·
    Davide Maran
    DBLP profile ↗ORCID search ↗
  15. Enhancing Manufacturing with AI-powered Process Design
    IJCAI 2024 ·
    Gianmarco Genalti
    DBLP profile ↗ORCID search ↗
  16. Finding Effective Ad Allocations: How to Exploit User History
    AAMAS 2024 ·
    Matteo Castiglioni
    DBLP profile ↗ORCID search ↗
  17. Graph-Triggered Rising Bandits
    ICML 2024 ·
    Gianmarco Genalti
    DBLP profile ↗ORCID search ↗
  18. Learning Optimal Contracts: How to Exploit Small Action Spaces
    ICLR 2024 ·
    Francesco Bacchiocchi
    DBLP profile ↗ORCID search ↗
  19. Online Bayesian Persuasion Without a Clue
    NeurIPS 2024 ·
    Francesco Bacchiocchi
    DBLP profile ↗ORCID search ↗
  20. Online Information Acquisition: Hiring Multiple Agents
    ICLR 2024 ·
    Federico Cacciamani
    DBLP profile ↗ORCID search ↗
  21. Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints
    ICML 2024 ·
    Francesco Emanuele Stradi
    DBLP profile ↗ORCID search ↗
  22. Online Learning with Off-Policy Feedback in Adversarial MDPs
    IJCAI 2024 ·
    Francesco Bacchiocchi
    DBLP profile ↗ORCID search ↗
  23. Online Markov Decision Processes Configuration with Continuous Decision Space
    AAAI 2024 ·
    Davide Maran
    DBLP profile ↗ORCID search ↗