Team-Maxmin Equilibrium: Efficiency Bounds and Algorithms. - Nicola Basilico; Andrea Celli; Giuseppe De Nittis; Nicola Gatti 001 (AAAI, 2017)

Coordinating Multiple Defensive Resources in Patrolling Games with Alarm Systems. - Nicola Basilico; Andrea Celli; Giuseppe De Nittis; Nicola Gatti 001 (AAMAS, 2017)

On the Complexity of Nash Equilibrium Reoptimization. - Andrea Celli; Alberto Marchesi 001; Nicola Gatti 001 (UAI, 2017)

Computing the Team-maxmin Equilibrium in Single-Team Single-Adversary Team Games. - Nicola Basilico; Andrea Celli; Giuseppe De Nittis; Nicola Gatti 001 (Intelligenza Artificiale, 2017)

Computational Results for Extensive-Form Adversarial Team Games. - Andrea Celli; Nicola Gatti 001 (AAAI, 2018)

Ex ante coordination and collusion in zero-sum multi-player extensive-form games. - Gabriele Farina; Andrea Celli; Nicola Gatti 001; Tuomas Sandholm (NeurIPS, 2018)

Learning dynamics in limited-control repeated games. - Andrea Celli; Alberto Marchesi 001 (Intelligenza Artificiale, 2018)

Computing Optimal Ex Ante Correlated Equilibria in Two-Player Sequential Games. - Andrea Celli; Stefano Coniglio; Nicola Gatti 001 (AAMAS, 2019)

Personality-Based Representations of Imperfect-Recall Games. - Andrea Celli; Giulia Romano; Nicola Gatti 001 (AAMAS, 2019)

Learning to Correlate in Multi-Player General-Sum Sequential Games. - Andrea Celli; Alberto Marchesi 001; Tommaso Bianchi; Nicola Gatti 001 (NeurIPS, 2019)

Computing Optimal Coarse Correlated Equilibria in Sequential Games. - Andrea Celli; Stefano Coniglio; Nicola Gatti 001 (CoRR, 2019)

Bayesian Persuasion with Sequential Games. - Andrea Celli; Stefano Coniglio; Nicola Gatti 001 (CoRR, 2019)

Coordination in Adversarial Sequential Team Games via Multi-Agent Deep Reinforcement Learning. - Andrea Celli; Marco Ciccone; Raffaele Bongo; Nicola Gatti 001 (CoRR, 2019)

Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud. - Matteo Castiglioni; Andrea Celli; Nicola Gatti 001 (AAAI, 2020)

Private Bayesian Persuasion with Sequential Games. - Andrea Celli; Stefano Coniglio; Nicola Gatti 001 (AAAI, 2020)

Online Bayesian Persuasion. - Matteo Castiglioni; Andrea Celli; Alberto Marchesi 001; Nicola Gatti 001 (NeurIPS, 2020)

No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium. - Andrea Celli; Alberto Marchesi 001; Gabriele Farina; Nicola Gatti 001 (NeurIPS, 2020)

No-regret learning dynamics for extensive-form correlated and coarse correlated equilibria. - Andrea Celli; Alberto Marchesi 001; Gabriele Farina; Nicola Gatti 001 (CoRR, 2020)

Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games. - Gabriele Farina; Andrea Celli; Nicola Gatti 001; Tuomas Sandholm (CoRR, 2020)

Coordination and correlation in multi-player sequential games. - Andrea Celli (2020)

Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry. - Matteo Castiglioni; Andrea Celli; Alberto Marchesi 001; Nicola Gatti 001 (AAAI, 2021)

Multi-Agent Coordination in Adversarial Environments through Signal Mediated Strategies. - Federico Cacciamani; Andrea Celli; Marco Ciccone; Nicola Gatti 001 (AAMAS, 2021)

Multi-Receiver Online Bayesian Persuasion. - Matteo Castiglioni; Alberto Marchesi 001; Andrea Celli; Nicola Gatti 001 (ICML, 2021)

Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results. - Gabriele Farina; Andrea Celli; Nicola Gatti 001; Tuomas Sandholm (ICML, 2021)

Decentralized No-regret Learning Algorithms for Extensive-form Correlated Equilibria (Extended Abstract). - Andrea Celli; Alberto Marchesi 001; Gabriele Farina; Nicola Gatti 001 (IJCAI, 2021)

Learning Fair Equilibria in Sponsored Search Auctions. - Andrea Celli; Riccardo Colini-Baldeschi; Stefano Leonardi 001 (CoRR, 2021)

Efficient Decentralized Learning Dynamics for Extensive-Form Coarse Correlated Equilibrium: No Expensive Computation of Stationary Distributions Required. - Gabriele Farina; Andrea Celli; Tuomas Sandholm (CoRR, 2021)

Online Learning with Knapsacks: the Best of Both Worlds. - Matteo Castiglioni; Andrea Celli; Christian Kroer (ICML, 2022)

Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective. - Georgios Birmpas; Andrea Celli; Riccardo Colini-Baldeschi; Stefano Leonardi 001 (IJCAI, 2022)

A Unifying Framework for Online Optimization with Long-Term Constraints. - Matteo Castiglioni; Andrea Celli; Alberto Marchesi 001; Giulia Romano; Nicola Gatti 001 (NeurIPS, 2022)

Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. - Ioannis Anagnostides; Gabriele Farina; Christian Kroer; Andrea Celli; Tuomas Sandholm (EC, 2022)

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation. - Brian Hu Zhang; Gabriele Farina; Andrea Celli; Tuomas Sandholm (EC, 2022)

The Parity Ray Regularizer for Pacing in Auction Markets. - Andrea Celli; Riccardo Colini-Baldeschi; Christian Kroer; Eric Sodomka (WWW, 2022)

Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium. - Gabriele Farina; Andrea Celli; Alberto Marchesi 001; Nicola Gatti 001 (J. ACM, 2022)

Fully Dynamic Online Selection through Online Contention Resolution Schemes. - Vashist Avadhanula; Andrea Celli; Riccardo Colini-Baldeschi; Stefano Leonardi 001; Matteo Russo 002 (AAAI, 2023)

Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Alberto Marchesi 001; Francesco Trovò; Nicola Gatti 001 (ICML, 2023)

Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. - Brian Hu Zhang; Gabriele Farina; Ioannis Anagnostides; Federico Cacciamani; Stephen McAleer; Andreas A. Haupt; Andrea Celli; Nicola Gatti 001; Vincent Conitzer; Tuomas Sandholm (NeurIPS, 2023)

Regret minimization in online Bayesian persuasion: Handling adversarial receiver's types under full and partial feedback models. - Matteo Castiglioni; Andrea Celli; Alberto Marchesi 001; Nicola Gatti 001 (Artif. Intell., 2023)

Online Bidding in Repeated Non-Truthful Auctions under Budget and ROI Constraints. - Matteo Castiglioni; Andrea Celli; Christian Kroer (CoRR, 2023)

Steering No-Regret Learners to Optimal Equilibria. - Brian Hu Zhang; Gabriele Farina; Ioannis Anagnostides; Federico Cacciamani; Stephen Marcus McAleer; Andreas Alexander Haupt; Andrea Celli; Nicola Gatti 001; Vincent Conitzer; Tuomas Sandholm (CoRR, 2023)

Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive. - Matteo Castiglioni; Andrea Celli; Nicola Gatti 001 (Algorithmica, 2023)

Bandits with Replenishable Knapsacks: the Best of both Worlds. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Federico Fusco (ICLR, 2024)

Online Learning under Budget and ROI Constraints via Weak Adaptivity. - Matteo Castiglioni; Andrea Celli; Christian Kroer (ICML, 2024)

Online Learning with Sublinear Best-Action Queries. - Matteo Russo 002; Andrea Celli; Riccardo Colini-Baldeschi; Federico Fusco; Daniel Haimovich; Dima Karamshuk; Stefano Leonardi 001; Niek Tax (NeurIPS, 2024)

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Federico Fusco (NeurIPS, 2024)

Agent-Designed Contracts: How to Sell Hidden Actions. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli (EC, 2024)

Steering No-Regret Learners to a Desired Equilibrium. - Brian Hu Zhang; Gabriele Farina; Ioannis Anagnostides; Federico Cacciamani; Stephen McAleer; Andreas A. Haupt; Andrea Celli; Nicola Gatti 001; Vincent Conitzer; Tuomas Sandholm (EC, 2024)

No-Regret Learning in Bilateral Trade via Global Budget Balance. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Federico Fusco (STOC, 2024)

Bandits with Knapsacks and Predictions. - Davide Drago; Andrea Celli; Marek Eliás 001 (UAI, 2024)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli (CoRR, 2024)

On the Role of Constraints in the Complexity of Min-Max Optimization. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Gabriele Farina (CoRR, 2024)

Feature-Based Online Bilateral Trade. - Solenne Gaucher; Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Vianney Perchet (ICLR, 2025)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information. - Maria-Florina Balcan; Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Keegan Harris; Zhiwei Steven Wu (CoRR, 2025)

Single-dimensional Contract Design: Efficient Algorithms and Learning. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli (CoRR, 2025)

Pure Exploration with Infinite Answers. - Riccardo Poiani; Martino Bernasconi; Andrea Celli (CoRR, 2025)

Non-Asymptotic Analysis of (Sticky) Track-and-Stop. - Riccardo Poiani; Martino Bernasconi; Andrea Celli (CoRR, 2025)

The Complexity of Correlated Equilibria in Generalized Games. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Gabriele Farina (CoRR, 2025)