Nicola Gatti
55 papers · 2017–2026 · 8 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+13 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (41) π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π
Grand Slam
π¬
Deep Specialist
(24)
π€
Dynamic Duo
(33)
π§¬
Topic Evolution
π
Keyword Champion
(2)
π
Triple Crown
π
Renaissance Researcher
(5)
π₯
Unstoppable Β· Silver
β‘
Prolific Year Β· Prolific
π
Conference Pioneer
π
Century Club Β· Silver
π
Trend Setter
ποΈ
Keyword Collector
(199)
Top co-authors
Research topics
Mathematics & Optimization
(38)
Machine Learning
(37)
Optimization
(37)
Artificial Intelligence
(33)
Core AI
(33)
Learning Types
(26)
Optimization & Theory
(25)
Reinforcement Learning
(11)
Methods
(6)
Applications
(5)
Bayesian & Probabilistic
(5)
Deep Learning
(2)
Computer Science
(1)
Computer Vision
(1)
Architectures
(1)
Keywords
online learning
(17)
game theory
(14)
regret bound
(12)
multi-agent system
(12)
extensive-form game
(10)
mechanism design
(9)
bayesian persuasion
(8)
correlated equilibrium
(7)
signaling scheme
(6)
nash equilibrium
(6)
no-regret learning
(5)
multi-armed bandit
(4)
computational complexity
(4)
bandit feedback
(4)
sublinear regret
(4)
stackelberg equilibrium
(4)
regret minimization
(4)
no-regret algorithm
(4)
stackelberg game
(4)
polynomial time algorithm
(4)
Papers
Truly Adapting to Adversarial Constraints in Constrained MABs
COLT 2026
Automating the loop in traffic incident management on highway
L4DC 2025
Contract Design Under Approximate Best Responses
ICML 2025
Learning Adversarial MDPs with Stochastic Hard Constraints
ICML 2025
Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
ICLR 2025
Policy Optimization for CMDPs with Bandit Feedback: Learning Stochastic and Adversarial Constraints
ICML 2025
The Sample Complexity of Stackelberg Games
AISTATS 2025
Autoregressive Bandits
AISTATS 2024
Bandits with Ranking Feedback
NeurIPS 2024
Enhancing Manufacturing with AI-powered Process Design
IJCAI 2024
Graph-Triggered Rising Bandits
ICML 2024
Learning Optimal Contracts: How to Exploit Small Action Spaces
ICLR 2024
Online Bayesian Persuasion Without a Clue
NeurIPS 2024
Online Information Acquisition: Hiring Multiple Agents
ICLR 2024
Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints
ICML 2024
Online Learning with Off-Policy Feedback in Adversarial MDPs
IJCAI 2024
Online Markov Decision Processes Configuration with Continuous Decision Space
AAAI 2024
(Ξ΅, u)-Adaptive Regret Minimization in Heavy-Tailed Bandits
COLT 2024
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games
NeurIPS 2023
Constrained Phi-Equilibria
ICML 2023
Dynamic Pricing with Volume Discounts in Online Settings
AAAI 2023
Online Mechanism Design for Information Acquisition
ICML 2023
Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion
ICML 2023
A Marriage between Adversarial Team Games and 2-player Games: Enabling Abstractions, No-regret Learning, and Subgame Solving
ICML 2022
A Unifying Framework for Online Optimization with Long-Term Constraints
NeurIPS 2022
Efficiency of Ad Auctions with Price Displaying
AAAI 2022
Multi-Armed Bandit Problem with Temporally-Partitioned Rewards: When Partial Feedback Counts
IJCAI 2022
Public Signaling in Bayesian Ad Auctions
IJCAI 2022
Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints
ICML 2022
Sequential Information Design: Learning to Persuade in the Dark
NeurIPS 2022
Signaling in Posted Price Auctions
AAAI 2022
Subgame Solving in Adversarial Team Games
NeurIPS 2022
The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding
IJCAI 2022
Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results
ICML 2021
Decentralized No-regret Learning Algorithms for Extensive-form Correlated Equilibria (Extended Abstract)
IJCAI 2021
Exploiting Opponents Under Utility Constraints in Sequential Games
NeurIPS 2021
Multi-Receiver Online Bayesian Persuasion
ICML 2021
Online Posted Pricing with Unknown Time-Discounted Valuations
AAAI 2021
Persuading Voters in District-based Elections
AAAI 2021
Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry
AAAI 2021
Trembling-Hand Perfection and Correlation in Sequential Games
AAAI 2021
Election Control in Social Networks via Edge Addition or Removal
AAAI 2020
No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium
NeurIPS 2020
Online Bayesian Persuasion
NeurIPS 2020
Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud
AAAI 2020
Private Bayesian Persuasion with Sequential Games
AAAI 2020
Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders
IJCAI 2019
Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions
IJCAI 2019
Learning to Correlate in Multi-Player General-Sum Sequential Games
NeurIPS 2019
Quasi-Perfect Stackelberg Equilibrium
AAAI 2019
Ex ante coordination and collusion in zero-sum multi-player extensive-form games
NeurIPS 2018
Leadership in Singleton Congestion Games
IJCAI 2018
Practical exact algorithm for trembling-hand equilibrium refinements in games
NeurIPS 2018
Trembling-Hand Perfection in Extensive-Form Games with Commitment
IJCAI 2018
Pessimistic Leader-Follower Equilibria with Multiple Followers
IJCAI 2017