Martino Bernasconi

CoRR, February, 2026

Optimal Rates for Feasible Payoff Set Estimation in Games.

[BibT_eX]

[DOI]

CoRR, February, 2026

The Complexity of Min-Max Optimization with Product Constraints.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

The Complexity of Correlated Equilibria in Generalized Games.

[BibT_eX]

[DOI]

CoRR, June, 2025

Non-Asymptotic Analysis of (Sticky) Track-and-Stop.

[BibT_eX]

[DOI]

Riccardo Poiani

CoRR, May, 2025

Pure Exploration with Infinite Answers.

[BibT_eX]

[DOI]

Riccardo Poiani

CoRR, May, 2025

Single-dimensional Contract Design: Efficient Algorithms and Learning.

[BibT_eX]

[DOI]

CoRR, February, 2025

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information.

[BibT_eX]

[DOI]

CoRR, February, 2025

Online learning in sequential Bayesian persuasion: Handling unknown priors.

[BibT_eX]

[DOI]

Artif. Intell., 2025

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization.

[BibT_eX]

[DOI]

Proceedings of the Forty-second International Conference on Machine Learning, 2025

Online Learning in the Random-Order Model.

[BibT_eX]

[DOI]

Riccardo Colini-Baldeschi

Federico Fusco

Stefano Leonardi

Matteo Russo

Proceedings of the Forty-second International Conference on Machine Learning, 2025

Feature-Based Online Bilateral Trade.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024

On the Role of Constraints in the Complexity of Min-Max Optimization.

[BibT_eX]

[DOI]

CoRR, 2024

Regret-Minimizing Contracts: Agency Under Uncertainty.

[BibT_eX]

[DOI]

Alberto Marchesi

CoRR, 2024

No-Regret Learning in Bilateral Trade via Global Budget Balance.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Multi-Agent Contract Design beyond Binary Actions.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Agent-Designed Contracts: How to Sell Hidden Actions.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Bandits with Replenishable Knapsacks: the Best of both Worlds.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Learning Extensive-Form Perfect Equilibria in Two-Player Zero-Sum Sequential Games.

[BibT_eX]

[DOI]

Alberto Marchesi

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

A framework for safe decision making: A convex duality approach.

[BibT_eX]

[DOI]

Federico Cacciamani

Intelligenza Artificiale, 2023

Advancing Fraud Detection Systems Through Online Learning.

[BibT_eX]

[DOI]

Tommaso Paladini

Proceedings of the Machine Learning and Knowledge Discovery in Databases: Applied Data Science and Demo Track, 2023

Persuading Farsighted Receivers in MDPs: the Power of Honesty.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Constrained Phi-Equilibria.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

2022

Last-iterate Convergence to Trembling-hand Perfect Equilibria.

[BibT_eX]

[DOI]

Alberto Marchesi

CoRR, 2022

Sequential Information Design: Learning to Persuade in the Dark.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Dark-Pool Smart Order Routing: a Combinatorial Multi-armed Bandit Approach.

[BibT_eX]

[DOI]

Proceedings of the 3rd ACM International Conference on AI in Finance, 2022

The Evolutionary Dynamics of Soft-Max Policy Gradient in Multi-Agent Settings.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Conservative Online Convex Optimization.

[BibT_eX]

[DOI]

Edoardo Vittori

Marcello Restelli

Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2021

Exploiting Opponents Under Utility Constraints in Sequential Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Dealing with transaction costs in portfolio optimization: online gradient descent with momentum.

[BibT_eX]

[DOI]

Edoardo Vittori