Pessimistic Leader-Follower Equilibria with Multiple Followers. - Stefano Coniglio; Nicola Gatti 001; Alberto Marchesi 001 (IJCAI, 2017)

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

Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria. - Nicola Basilico; Stefano Coniglio; Nicola Gatti 001; Alberto Marchesi 001 (SEA, 2017)

Computing the Strategy to Commit to in Polymatrix Games. - Giuseppe De Nittis; Alberto Marchesi 001; Nicola Gatti 001 (AAAI, 2018)

Trembling-Hand Perfection in Extensive-Form Games with Commitment. - Gabriele Farina; Alberto Marchesi 001; Christian Kroer; Nicola Gatti 001; Tuomas Sandholm (IJCAI, 2018)

Leadership in Singleton Congestion Games. - Alberto Marchesi 001; Stefano Coniglio; Nicola Gatti 001 (IJCAI, 2018)

Computing the Strategy to Commit to in Polymatrix Games (Extended Version). - Giuseppe De Nittis; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2018)

Computing a Pessimistic Leader-Follower Equilibrium with Multiple Followers: the Mixed-Pure Case. - Stefano Coniglio; Nicola Gatti 001; Alberto Marchesi 001 (CoRR, 2018)

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

Quasi-Perfect Stackelberg Equilibrium. - Alberto Marchesi 001; Gabriele Farina; Christian Kroer; Nicola Gatti 001; Tuomas Sandholm (AAAI, 2019)

Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders. - Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (IJCAI, 2019)

Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions. - Alberto Marchesi 001; Matteo Castiglioni; Nicola Gatti 001 (IJCAI, 2019)

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

Leadership in singleton congestion games: What is hard and what is easy. - Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001; Stefano Coniglio (Artif. Intell., 2019)

Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders (Extended Version). - Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2019)

Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions (Extended Version). - Alberto Marchesi 001; Matteo Castiglioni; Nicola Gatti 001 (CoRR, 2019)

Learning Probably Approximately Correct Maximin Strategies in Simulation-Based Games with Infinite Strategy Spaces. - Alberto Marchesi 001; Francesco Trovò; Nicola Gatti 001 (AAMAS, 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)

Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case. - Stefano Coniglio; Nicola Gatti 001; Alberto Marchesi 001 (Algorithmica, 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)

Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games. - Nicola Basilico; Stefano Coniglio; Nicola Gatti 001; Alberto Marchesi 001 (EURO J. Comput. Optim., 2020)

A characterization of quasi-perfect equilibria. - Nicola Gatti 001; Mario Gilli; Alberto Marchesi 001 (Games Econ. Behav., 2020)

Leadership games: multiple followers, multiple leaders, and perfection. - Alberto Marchesi 001 (2020)

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

Trembling-Hand Perfection and Correlation in Sequential Games. - Alberto Marchesi 001; Nicola Gatti 001 (AAAI, 2021)

Online Posted Pricing with Unknown Time-Discounted Valuations. - Giulia Romano; Gianluca Tartaglia; Alberto Marchesi 001; Nicola Gatti 001 (AAAI, 2021)

Multi-Receiver Online Bayesian Persuasion. - Matteo Castiglioni; Alberto Marchesi 001; Andrea Celli; Nicola Gatti 001 (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)

Exploiting Opponents Under Utility Constraints in Sequential Games. - Martino Bernasconi de Luca; Federico Cacciamani; Simone Fioravanti; Nicola Gatti 001; Alberto Marchesi 001; Francesco Trovò (NeurIPS, 2021)

Committing to correlated strategies with multiple leaders. - Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (Artif. Intell., 2021)

Efficiency of Ad Auctions with Price Displaying. - Matteo Castiglioni; Diodato Ferraioli; Nicola Gatti 001; Alberto Marchesi 001; Giulia Romano (AAAI, 2022)

Signaling in Posted Price Auctions. - Matteo Castiglioni; Giulia Romano; Alberto Marchesi 001; Nicola Gatti 001 (AAAI, 2022)

Bayesian Persuasion Meets Mechanism Design: Going Beyond Intractability with Type Reporting. - Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (AAMAS, 2022)

Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints. - Martino Bernasconi; Federico Cacciamani; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001; Francesco Trovò (ICML, 2022)

Public Signaling in Bayesian Ad Auctions. - Francesco Bacchiocchi; Matteo Castiglioni; Alberto Marchesi 001; Giulia Romano; Nicola Gatti 001 (IJCAI, 2022)

The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding. - Giulia Romano; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (IJCAI, 2022)

Sequential Information Design: Learning to Persuade in the Dark. - Martino Bernasconi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001; Francesco Trovò (NeurIPS, 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)

Bayesian agency: Linear versus tractable contracts. - Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (Artif. Intell., 2022)

Last-iterate Convergence to Trembling-hand Perfect Equilibria. - Martino Bernasconi; Alberto Marchesi 001; Francesco Trovò (CoRR, 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)

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)

Constrained Phi-Equilibria. - Martino Bernasconi; Matteo Castiglioni; Alberto Marchesi 001; Francesco Trovò; Nicola Gatti 001 (ICML, 2023)

Persuading Farsighted Receivers in MDPs: the Power of Honesty. - Martino Bernasconi; Matteo Castiglioni; Alberto Marchesi 001; Mirco Mutti (NeurIPS, 2023)

Multi-Agent Contract Design: How to Commission Multiple Agents with Individual Outcomes. - Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (EC, 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)

Multi-Agent Contract Design: How to Commission Multiple Agents with Individual Outcome. - Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2023)

Selling Information while Being an Interested Party. - Matteo Castiglioni; Francesco Bacchiocchi; Alberto Marchesi 001; Giulia Romano; Nicola Gatti 001 (CoRR, 2023)

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints. - Jacopo Germano; Francesco Emanuele Stradi; Gianmarco Genalti; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2023)

Designing menus of contracts efficiently: The power of randomization. - Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (Artif. Intell., 2023)

Increasing revenue in Bayesian posted price auctions through signaling. - Matteo Castiglioni; Alberto Marchesi 001; Giulia Romano; Nicola Gatti 001 (Artif. Intell., 2023)

Learning Extensive-Form Perfect Equilibria in Two-Player Zero-Sum Sequential Games. - Martino Bernasconi; Alberto Marchesi 001; Francesco Trovò (AISTATS, 2024)

Finding Effective Ad Allocations: How to Exploit User History. - Matteo Castiglioni; Alberto Latino; Alberto Marchesi 001; Giulia Romano; Nicola Gatti 001; Chokha Palayamkottai (AAMAS, 2024)

Learning Optimal Contracts: How to Exploit Small Action Spaces. - Francesco Bacchiocchi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (ICLR, 2024)

Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints. - Francesco Emanuele Stradi; Jacopo Germano; Gianmarco Genalti; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (ICML, 2024)

Online Bayesian Persuasion Without a Clue. - Francesco Bacchiocchi; Matteo Bollini; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (NeurIPS, 2024)

Markov Persuasion Processes: Learning to Persuade from Scratch. - Francesco Bacchiocchi; Francesco Emanuele Stradi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2024)

Regret-Minimizing Contracts: Agency Under Uncertainty. - Martino Bernasconi; Matteo Castiglioni; Alberto Marchesi 001 (CoRR, 2024)

Learning Adversarial MDPs with Stochastic Hard Constraints. - Francesco Emanuele Stradi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2024)

Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints. - Francesco Emanuele Stradi; Anna Lunghi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2024)

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback. - Francesco Emanuele Stradi; Anna Lunghi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2024)

Contracting With a Reinforcement Learning Agent by Playing Trick or Treat. - Matteo Bollini; Francesco Bacchiocchi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2024)

The Sample Complexity of Stackelberg Games. - Francesco Bacchiocchi; Matteo Bollini; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (AISTATS, 2025)

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization. - Francesco Emanuele Stradi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (ICLR, 2025)

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond. - Francesco Bacchiocchi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (EC, 2025)

Learning optimal contracts with small action spaces. - Francesco Bacchiocchi; Matteo Castiglioni; Nicola Gatti 001; Alberto Marchesi 001 (Artif. Intell., 2025)

Online learning in sequential Bayesian persuasion: Handling unknown priors. - Martino Bernasconi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001; Francesco Trovò (Artif. Intell., 2025)

Contract Design Under Approximate Best Responses. - Francesco Bacchiocchi; Jiarui Gan; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2025)

Online Two-Sided Markets: Many Buyers Enhance Learning. - Anna Lunghi; Matteo Castiglioni; Alberto Marchesi 001 (CoRR, 2025)

Data-Dependent Regret Bounds for Constrained MABs. - Gianmarco Genalti; Francesco Emanuele Stradi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001 (CoRR, 2025)

No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need! - Francesco Emanuele Stradi; Matteo Castiglioni; Alberto Marchesi 001; Nicola Gatti 001; Christian Kroer (CoRR, 2025)

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation. - Anna Lunghi; Matteo Castiglioni; Alberto Marchesi 001 (CoRR, 2025)