default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Celli
- > Home > Persons > Andrea Celli
Publications
- 2024
[c30]Brian Hu Zhang
, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Steering No-Regret Learners to a Desired Equilibrium. EC 2024: 73-74- 2023
- [j5]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Regret minimization in online Bayesian persuasion: Handling adversarial receiver's types under full and partial feedback models. Artif. Intell. 314: 103821 (2023) - [j4]Matteo Castiglioni, Andrea Celli, Nicola Gatti:
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive. Algorithmica 85(9): 2885-2921 (2023) - [c25]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Francesco Trovò, Nicola Gatti:
Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion. ICML 2023: 2164-2183 - [c24]Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. NeurIPS 2023 - [i26]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola Gatti, Francesco Trovò:
Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion. CoRR abs/2303.01296 (2023) - [i25]Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. CoRR abs/2306.05216 (2023) - [i24]Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Steering No-Regret Learners to Optimal Equilibria. CoRR abs/2306.05221 (2023) - 2022
- [j3]Gabriele Farina, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium. J. ACM 69(6): 41:1-41:41 (2022) - [c21]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Giulia Romano, Nicola Gatti:
A Unifying Framework for Online Optimization with Long-Term Constraints. NeurIPS 2022 - [i18]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Giulia Romano, Nicola Gatti:
A Unifying Framework for Online Optimization with Long-Term Constraints. CoRR abs/2209.07454 (2022) - 2021
- [c17]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry. AAAI 2021: 5252-5259 - [c16]Federico Cacciamani, Andrea Celli, Marco Ciccone, Nicola Gatti:
Multi-Agent Coordination in Adversarial Environments through Signal Mediated Strategies. AAMAS 2021: 269-278 - [c15]Matteo Castiglioni, Alberto Marchesi, Andrea Celli, Nicola Gatti:
Multi-Receiver Online Bayesian Persuasion. ICML 2021: 1314-1323 - [c14]Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm:
Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results. ICML 2021: 3164-3173 - [c13]Andrea Celli, Alberto Marchesi, Gabriele Farina, Nicola Gatti:
Decentralized No-regret Learning Algorithms for Extensive-form Correlated Equilibria (Extended Abstract). IJCAI 2021: 4755-4759 - [i17]Federico Cacciamani, Andrea Celli, Marco Ciccone, Nicola Gatti:
Multi-Agent Coordination in Adversarial Environments through Signal Mediated Strategies. CoRR abs/2102.05026 (2021) - [i16]Gabriele Farina, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium. CoRR abs/2104.01520 (2021) - [i15]Matteo Castiglioni, Alberto Marchesi, Andrea Celli, Nicola Gatti:
Multi-Receiver Online Bayesian Persuasion. CoRR abs/2106.06480 (2021) - 2020
- [c12]Matteo Castiglioni, Andrea Celli, Nicola Gatti:
Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud. AAAI 2020: 1870-1877 - [c11]Andrea Celli, Stefano Coniglio, Nicola Gatti:
Private Bayesian Persuasion with Sequential Games. AAAI 2020: 1886-1893 - [c10]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Online Bayesian Persuasion. NeurIPS 2020 - [c9]Andrea Celli, Alberto Marchesi, Gabriele Farina, Nicola Gatti:
No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium. NeurIPS 2020 - [i11]Matteo Castiglioni, Andrea Celli, Nicola Gatti:
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive. CoRR abs/2002.05156 (2020) - [i10]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry. CoRR abs/2002.05190 (2020) - [i9]Andrea Celli, Alberto Marchesi, Gabriele Farina, Nicola Gatti:
No-regret learning dynamics for extensive-form correlated and coarse correlated equilibria. CoRR abs/2004.00603 (2020) - [i8]Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm:
Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games. CoRR abs/2009.10061 (2020) - 2019
- [c8]Andrea Celli, Stefano Coniglio, Nicola Gatti:
Computing Optimal Ex Ante Correlated Equilibria in Two-Player Sequential Games. AAMAS 2019: 909-917 - [c7]Andrea Celli, Giulia Romano, Nicola Gatti:
Personality-Based Representations of Imperfect-Recall Games. AAMAS 2019: 1868-1870 - [c6]Andrea Celli, Alberto Marchesi, Tommaso Bianchi, Nicola Gatti:
Learning to Correlate in Multi-Player General-Sum Sequential Games. NeurIPS 2019: 13055-13065 - [i7]Andrea Celli, Stefano Coniglio, Nicola Gatti:
Computing Optimal Coarse Correlated Equilibria in Sequential Games. CoRR abs/1901.06221 (2019) - [i6]Andrea Celli, Stefano Coniglio, Nicola Gatti:
Bayesian Persuasion with Sequential Games. CoRR abs/1908.00877 (2019) - [i5]Matteo Castiglioni, Andrea Celli, Nicola Gatti:
Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud. CoRR abs/1908.10620 (2019) - [i4]Andrea Celli, Alberto Marchesi, Tommaso Bianchi, Nicola Gatti:
Learning to Correlate in Multi-Player General-Sum Sequential Games. CoRR abs/1910.06228 (2019) - [i3]Andrea Celli, Marco Ciccone, Raffaele Bongo, Nicola Gatti:
Coordination in Adversarial Sequential Team Games via Multi-Agent Deep Reinforcement Learning. CoRR abs/1912.07712 (2019) - 2018
- [c5]Andrea Celli, Nicola Gatti:
Computational Results for Extensive-Form Adversarial Team Games. AAAI 2018: 965-972 - [c4]Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm:
Ex ante coordination and collusion in zero-sum multi-player extensive-form games. NeurIPS 2018: 9661-9671 - 2017
- [j1]Nicola Basilico, Andrea Celli, Giuseppe De Nittis, Nicola Gatti:
Computing the Team-maxmin Equilibrium in Single-Team Single-Adversary Team Games. Intelligenza Artificiale 11(1): 67-79 (2017) - [c3]Nicola Basilico, Andrea Celli, Giuseppe De Nittis, Nicola Gatti:
Team-Maxmin Equilibrium: Efficiency Bounds and Algorithms. AAAI 2017: 356-362 - [c2]Nicola Basilico, Andrea Celli, Giuseppe De Nittis, Nicola Gatti:
Coordinating Multiple Defensive Resources in Patrolling Games with Alarm Systems. AAMAS 2017: 678-686 - [c1]Andrea Celli, Alberto Marchesi, Nicola Gatti:
On the Complexity of Nash Equilibrium Reoptimization. UAI 2017 - [i2]Andrea Celli, Nicola Gatti:
Computational Results for Extensive-Form Adversarial Team Games. CoRR abs/1711.06930 (2017) - 2016
- [i1]Nicola Basilico, Andrea Celli, Giuseppe De Nittis, Nicola Gatti:
Team-maxmin equilibrium: efficiency bounds and algorithms. CoRR abs/1611.06134 (2016)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-04-02 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
