| Sequential information design: Learning to persuade in the dark M Bernasconi, M Castiglioni, A Marchesi, N Gatti, F Trovò Advances in Neural Information Processing Systems 35, 15917-15928, 2022 | 29 | 2022 |
| 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 |
| Exploiting opponents under utility constraints in sequential games M Bernasconi-de-Luca, F Cacciamani, S Fioravanti, N Gatti, A Marchesi, ... Advances in Neural Information Processing Systems 34, 13177-13188, 2021 | 16 | 2021 |
| Safe learning in tree-form sequential decision making: Handling hard and soft constraints M Bernasconi, F Cacciamani, M Castiglioni, A Marchesi, N Gatti, F Trovò International Conference on Machine Learning, 1854-1873, 2022 | 14 | 2022 |
| No-regret learning in bilateral trade via global budget balance M Bernasconi, M Castiglioni, A Celli, F Fusco Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 247-258, 2024 | 11 | 2024 |
| Dealing with transaction costs in portfolio optimization: Online gradient descent with momentum E Vittori, MB de Luca, F Trovò, M Restelli Proceedings of the First ACM International Conference on AI in Finance, 1-8, 2020 | 10 | 2020 |
| Constrained phi-equilibria M Bernasconi, M Castiglioni, A Marchesi, F Trovo, N Gatti International Conference on Machine Learning, 2184-2205, 2023 | 9 | 2023 |
| Bandits with replenishable knapsacks: the best of both worlds M Bernasconi, M Castiglioni, A Celli, F Fusco arXiv preprint arXiv:2306.08470, 2023 | 9 | 2023 |
| Persuading farsighted receivers in mdps: the power of honesty M Bernasconi, M Castiglioni, A Marchesi, M Mutti Advances in Neural Information Processing Systems 36, 14987-15014, 2023 | 6 | 2023 |
| Conservative online convex optimization M Bernasconi de Luca, E Vittori, F Trovò, M Restelli Machine Learning and Knowledge Discovery in Databases. Research Track …, 2021 | 6 | 2021 |
| ITCH50Converter M Bernasconi, L Fusco, O Dragić https://github.com/martinobdl/ITCH, 2021 | 5* | 2021 |
| Multi-agent contract design beyond binary actions F Cacciamani, M Bernasconi, M Castiglioni, N Gatti arXiv preprint arXiv:2402.13824, 2024 | 4 | 2024 |
| No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization M Bernasconi, M Castiglioni, A Celli arXiv preprint arXiv:2405.06575, 2024 | 3 | 2024 |
| Agent-Designed Contracts: How to Sell Hidden Actions M Bernasconi, M Castiglioni, A Celli arXiv preprint arXiv:2402.16547, 2024 | 3 | 2024 |
| Advancing Fraud Detection Systems Through Online Learning T Paladini, M Bernasconi de Luca, M Carminati, M Polino, F Trovò, ... Joint European Conference on Machine Learning and Knowledge Discovery in …, 2023 | 3 | 2023 |
| Dark-pool smart order routing: a combinatorial multi-armed bandit approach M Bernasconi, S Martino, E Vittori, F Trovò, M Restelli Proceedings of the Third ACM International Conference on AI in Finance, 352-360, 2022 | 2 | 2022 |
| Last-iterate Convergence to Trembling-hand Perfect Equilibria M Bernasconi, A Marchesi, F Trovò arXiv preprint arXiv:2208.08238, 2022 | 2 | 2022 |
| The Evolutionary Dynamics of Soft-Max Policy Gradient in Games M Bernasconi, F Cacciamani, S Fioravanti, N Gatti, F Trovo, ... | 2 | 2022 |
| The Evolutionary Dynamics of Soft-Max Policy Gradient in Multi-Agent Setting M Bernasconi, F Cacciamani, S Fioravanti, N Gatti, F Trovò Available at SSRN 4159835, 2022 | 2 | 2022 |
| Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints M Bernasconi, M Castiglioni, A Celli, F Fusco arXiv preprint arXiv:2405.16118, 2024 | 1 | 2024 |
Francesco TrovòPolitecnico di Milano, Dipartimento di Elettronica, Informazione e BioingegneriaEmail verificata su polimi.it