| Online Bayesian persuasion M Castiglioni, A Celli, A Marchesi, N Gatti Advances in Neural Information Processing Systems 33, 2020 | 81 | 2020 |
| No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium A Celli, A Marchesi, G Farina, N Gatti Advances in Neural Information Processing Systems 33, 2020 | 73 | 2020 |
| Signaling in Bayesian network congestion games: the subtle power of symmetry M Castiglioni, A Celli, A Marchesi, N Gatti Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5252-5259, 2021 | 50 | 2021 |
| Multi-Receiver Online Bayesian Persuasion M Castiglioni, A Marchesi, A Celli, N Gatti Proceedings of the 38th International Conference on Machine Learning 139 …, 2021 | 46 | 2021 |
| Learning to correlate in multi-player general-sum sequential games A Celli, A Marchesi, T Bianchi, N Gatti Advances in Neural Information Processing Systems 32, 2019 | 44 | 2019 |
| Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium G Farina, A Celli, A Marchesi, N Gatti Journal of the ACM 69 (6), 1-41, 2022 | 42 | 2022 |
| Designing Menus of Contracts Efficiently: The Power of Randomization M Castiglioni, A Marchesi, N Gatti The 23rd ACM Conference on Economics and Computation, 705-735, 2022 | 38 | 2022 |
| Bayesian agency: Linear versus tractable contracts M Castiglioni, A Marchesi, N Gatti Proceedings of the 22nd ACM Conference on Economics and Computation, 285-286, 2021 | 37 | 2021 |
| Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case S Coniglio, N Gatti, A Marchesi Algorithmica 82 (5), 1189-1238, 2020 | 34* | 2020 |
| Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria N Basilico, S Coniglio, N Gatti, A Marchesi Leibniz International Proceedings in Informatics 75, 1-14, 2017 | 31 | 2017 |
| Pessimistic leader-follower equilibria with multiple followers S Coniglio, N Gatti, A Marchesi Proceedings of the Twenty-Sixth International Joint Conference on Artificial …, 2017 | 31 | 2017 |
| A unifying framework for online optimization with long-term constraints M Castiglioni, A Celli, A Marchesi, G Romano, N Gatti Thirty-Sixth Conference on Neural Information Processing Systems, 2022 | 30 | 2022 |
| Sequential information design: Learning to persuade in the dark M Bernasconi, M Castiglioni, A Marchesi, N Gatti, F Trovò Thirty-Sixth Conference on Neural Information Processing Systems, 2022 | 28 | 2022 |
| Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games N Basilico, S Coniglio, N Gatti, A Marchesi EURO Journal on Computational Optimization 8 (1), 3-31, 2020 | 25 | 2020 |
| Leadership in singleton congestion games: What is hard and what is easy M Castiglioni, A Marchesi, N Gatti, S Coniglio Artificial Intelligence 277, 103177, 2019 | 23 | 2019 |
| Optimal rates and efficient algorithms for online Bayesian persuasion M Bernasconi, M Castiglioni, A Celli, A Marchesi, F Trovò, N Gatti International Conference on Machine Learning, 2164-2183, 2023 | 22 | 2023 |
| Signaling in Posted Price Auctions M Castiglioni, G Romano, A Marchesi, N Gatti Thirty-Sixth AAAI Conference on Artificial Intelligence, 4941-4948, 2022 | 22 | 2022 |
| Leadership in singleton congestion games A Marchesi, S Coniglio, N Gatti Proceedings of the Twenty-Seventh International Joint Conference on …, 2018 | 22 | 2018 |
| Computing the strategy to commit to in polymatrix games G De Nittis, A Marchesi, N Gatti Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 989-996, 2018 | 21 | 2018 |
| Trembling-Hand Perfection in Extensive-Form Games with Commitment G Farina, A Marchesi, C Kroer, N Gatti, T Sandholm Proceedings of the Twenty-Seventh International Joint Conference on …, 2018 | 21 | 2018 |
Nicola GattiPolitecnico di MilanoVerified email at elet.polimi.it
