Matteo Castiglioni
36 papers · 2019–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+13 more ↓ Show less ↑
π Conference Polyglot (6) π Academic Marathon (6) π Interdisciplinary Bridge π§ Keyword Pioneer π Cross-Pollinator (6)
πΊοΈ
Taxonomy Completionist
(22)
π£
Hot Topic Early Bird
π
Conference Polyglot
(6)
π€
Dynamic Duo
(29)
π
Triple Crown
π
Grand Slam
π¬
Deep Specialist
(10)
π§¬
Topic Evolution
π
Keyword Champion
(6)
π
Century Club
(36)
π₯
Unstoppable
(7)
β‘
Prolific Year
(9)
ποΈ
Keyword Collector
(93)
Conferences
ICML (13)
NIPS (7)
AAAI (6)
ICLR (5)
IJCAI (4)
AISTATS (1)
Top co-authors
Keywords
online learning
(9)
regret bound
(7)
bayesian persuasion
(7)
signaling scheme
(6)
game theory
(5)
mechanism design
(4)
computational complexity
(4)
multi-agent system
(4)
regret minimization
(3)
adversarial learning
(3)
ad auction
(3)
no-regret algorithm
(3)
nash equilibrium
(2)
voting mechanism
(2)
vcg mechanism
(2)
signaling games
(2)
correlated equilibrium
(2)
online algorithm
(2)
stochastic optimization
(2)
multi-armed bandit
(2)
Papers
Policy Optimization for CMDPs with Bandit Feedback: Learning Stochastic and Adversarial Constraints
ICML 2025
Learning Adversarial MDPs with Stochastic Hard Constraints
ICML 2025
No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
ICML 2025
Contract Design Under Approximate Best Responses
ICML 2025
The Sample Complexity of Stackelberg Games
AISTATS 2025
Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
ICLR 2025
Feature-Based Online Bilateral Trade
ICLR 2025
Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints
ICML 2024
Bandits with Ranking Feedback
NIPS 2024
Online Learning under Budget and ROI Constraints via Weak Adaptivity
ICML 2024
Graph-Triggered Rising Bandits
ICML 2024
Learning Optimal Contracts: How to Exploit Small Action Spaces
ICLR 2024
Online Information Acquisition: Hiring Multiple Agents
ICLR 2024
Bandits with Replenishable Knapsacks: the Best of both Worlds
ICLR 2024
Online Bayesian Persuasion Without a Clue
NIPS 2024
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
NIPS 2024
Persuading Farsighted Receivers in MDPs: the Power of Honesty
NIPS 2023
Constrained Phi-Equilibria
ICML 2023
Online Mechanism Design for Information Acquisition
ICML 2023
Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion
ICML 2023
The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding
IJCAI 2022
Sequential Information Design: Learning to Persuade in the Dark
NIPS 2022
A Unifying Framework for Online Optimization with Long-Term Constraints
NIPS 2022
Efficiency of Ad Auctions with Price Displaying
AAAI 2022
Signaling in Posted Price Auctions
AAAI 2022
Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints
ICML 2022
Online Learning with Knapsacks: the Best of Both Worlds
ICML 2022
Public Signaling in Bayesian Ad Auctions
IJCAI 2022
Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry
AAAI 2021
Persuading Voters in District-based Elections
AAAI 2021
Multi-Receiver Online Bayesian Persuasion
ICML 2021
Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud
AAAI 2020
Online Bayesian Persuasion
NIPS 2020
Election Control in Social Networks via Edge Addition or Removal
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