Andrea Celli
24 papers · 2018–2025 · 6 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 ↓+11 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (24) π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Bronze π£ Hot Topic Early Bird
π¬
Deep Specialist
(10)
π
Grand Slam
π€
Dynamic Duo
(13)
π
Triple Crown
π§¬
Topic Evolution
π
Keyword Champion
(3)
ποΈ
Keyword Collector
(100)
β‘
Prolific Year Β· Productive
π₯
Unstoppable Β· Bronze
π
Century Club Β· Bronze
π
Trend Setter
Top co-authors
Research topics
Machine Learning
(21)
Optimization & Theory
(16)
Mathematics & Optimization
(15)
Optimization
(15)
Artificial Intelligence
(14)
Core AI
(14)
Learning Types Β· Machine Learning
(11)
Reinforcement Learning
(3)
Applications
(3)
Bayesian & Probabilistic
(3)
Deep Learning
(1)
Application Areas
(1)
Core Methods
(1)
Learning Types Β· Deep Learning
(1)
Keywords
online learning
(9)
multi-agent system
(8)
regret bound
(8)
game theory
(7)
extensive-form game
(5)
bayesian persuasion
(5)
correlated equilibrium
(4)
signaling scheme
(4)
competitive ratio
(4)
regret minimization
(4)
bandits with knapsack
(3)
primal-dual algorithm
(3)
multi-agent learning
(2)
no-regret algorithm
(2)
nash equilibrium
(2)
zero-sum game
(2)
mechanism design
(2)
bandit feedback
(2)
multi-armed bandit
(2)
adversarial learning
(2)
Papers
Feature-Based Online Bilateral Trade
ICLR 2025
No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
ICML 2025
Online Learning in the Random-Order Model
ICML 2025
Bandits with Knapsacks and Predictions
UAI 2024
Bandits with Replenishable Knapsacks: the Best of both Worlds
ICLR 2024
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
NeurIPS 2024
Online Learning under Budget and ROI Constraints via Weak Adaptivity
ICML 2024
Online Learning with Sublinear Best-Action Queries
NeurIPS 2024
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games
NeurIPS 2023
Fully Dynamic Online Selection through Online Contention Resolution Schemes
AAAI 2023
Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion
ICML 2023
A Unifying Framework for Online Optimization with Long-Term Constraints
NeurIPS 2022
Fair Equilibria in Sponsored Search Auctions: The Advertisersβ Perspective
IJCAI 2022
Online Learning with Knapsacks: the Best of Both Worlds
ICML 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
Multi-Receiver Online Bayesian Persuasion
ICML 2021
Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry
AAAI 2021
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
Learning to Correlate in Multi-Player General-Sum Sequential Games
NeurIPS 2019
Ex ante coordination and collusion in zero-sum multi-player extensive-form games
NeurIPS 2018