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)

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)

Election Manipulation on Social Networks with Messages on Multiple Candidates. - Matteo Castiglioni; Diodato Ferraioli; Giulia Landriani; Nicola Gatti 001 (CoRR, 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)

Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud. - Matteo Castiglioni; Andrea Celli; Nicola Gatti 001 (AAAI, 2020)

Election Control in Social Networks via Edge Addition or Removal. - Matteo Castiglioni; Diodato Ferraioli; Nicola Gatti 001 (AAAI, 2020)

Online Bayesian Persuasion. - Matteo Castiglioni; Andrea Celli; Alberto Marchesi 001; Nicola Gatti 001 (NeurIPS, 2020)

Election Manipulation on Social Networks with Messages on Multiple Candidates Extended Abstract. - Matteo Castiglioni; Diodato Ferraioli; Nicola Gatti 001; Giulia Landriani (TAILOR, 2020)

Persuading Voters in District-based Elections. - Matteo Castiglioni; Nicola Gatti 001 (AAAI, 2021)

Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry. - Matteo Castiglioni; Andrea Celli; 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)

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

Election Manipulation on Social Networks: Seeding, Edge Removal, Edge Addition. - Matteo Castiglioni; Diodato Ferraioli; Nicola Gatti 001; Giulia Landriani (J. Artif. Intell. Res., 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)

Online Learning with Knapsacks: the Best of Both Worlds. - Matteo Castiglioni; Andrea Celli; Christian Kroer (ICML, 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)

Safe Online Bid Optimization with Return-On-Investment and Budget Constraints subject to Uncertainty. - Matteo Castiglioni; Alessandro Nuara; Giulia Romano; Giorgio Spadaro; Francesco Trovò; Nicola Gatti 001 (CoRR, 2022)

Reducing the gap between theory and applications in algorithmic Bayesian persuasion. - Matteo Castiglioni (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)

Online Mechanism Design for Information Acquisition. - Federico Cacciamani; Matteo Castiglioni; 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)

Online Bidding in Repeated Non-Truthful Auctions under Budget and ROI Constraints. - Matteo Castiglioni; Andrea Celli; Christian Kroer (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)

A framework for safe decision making: A convex duality approach. - Martino Bernasconi; Federico Cacciamani; Matteo Castiglioni (Intelligenza Artificiale, 2023)

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

Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive. - Matteo Castiglioni; Andrea Celli; Nicola Gatti 001 (Algorithmica, 2023)

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

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)

Bandits with Replenishable Knapsacks: the Best of both Worlds. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Federico Fusco (ICLR, 2024)

Online Information Acquisition: Hiring Multiple Agents. - Federico Cacciamani; Matteo Castiglioni; Nicola Gatti 001 (ICLR, 2024)

Online Learning under Budget and ROI Constraints via Weak Adaptivity. - Matteo Castiglioni; Andrea Celli; Christian Kroer (ICML, 2024)

Graph-Triggered Rising Bandits. - Gianmarco Genalti; Marco Mussi; Nicola Gatti 001; Marcello Restelli; Matteo Castiglioni; Alberto Maria Metelli (ICML, 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)

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Federico Fusco (NeurIPS, 2024)

Bandits with Ranking Feedback. - Davide Maran; Francesco Bacchiocchi; Francesco Emanuele Stradi; Matteo Castiglioni; Nicola Gatti 001; Marcello Restelli (NeurIPS, 2024)

Agent-Designed Contracts: How to Sell Hidden Actions. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli (EC, 2024)

Multi-Agent Contract Design beyond Binary Actions. - Federico Cacciamani; Martino Bernasconi; Matteo Castiglioni; Nicola Gatti 001 (EC, 2024)

No-Regret Learning in Bilateral Trade via Global Budget Balance. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Federico Fusco (STOC, 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)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli (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)

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting. - Gianmarco Genalti; Marco Mussi; Nicola Gatti 001; Marcello Restelli; Matteo Castiglioni; Alberto Maria Metelli (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)

On the Role of Constraints in the Complexity of Min-Max Optimization. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Gabriele Farina (CoRR, 2024)

Maximizing Revenue From Selfish Agents in Crowd Tasks: Indirect Incentive Strategies. - Mina Montazeri; Matteo Castiglioni; Giulia Romano; Hamed Kebriaei; Nicola Gatti 001 (IEEE Control. Syst. Lett., 2024)

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

Feature-Based Online Bilateral Trade. - Solenne Gaucher; Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Vianney Perchet (ICLR, 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)

Safe Online Bid Optimization with Return on Investment and Budget Constraints. - Matteo Castiglioni; Alessandro Nuara; Giulia Romano; Giorgio Spadaro; Francesco Trovò; Nicola Gatti 001 (KDD (1), 2025)

Multi-Project Contracts. - Tal Alon; Matteo Castiglioni; Junjie Chen; Tomer Ezra; Yingkai Li; Inbal Talgam-Cohen (EC, 2025)

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

Hiring for An Uncertain Task: Joint Design of Information and Contracts. - Matteo Castiglioni; Junjie Chen (SODA, 2025)

A Reduction from Multi-Parameter to Single-Parameter Bayesian Contract Design. - Matteo Castiglioni; Junjie Chen; Minming Li; Haifeng Xu; Song Zuo (SODA, 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)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information. - Maria-Florina Balcan; Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Keegan Harris; Zhiwei Steven Wu (CoRR, 2025)

Single-dimensional Contract Design: Efficient Algorithms and Learning. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli (CoRR, 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)

The Complexity of Correlated Equilibria in Generalized Games. - Martino Bernasconi; Matteo Castiglioni; Andrea Celli; Gabriele Farina (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)

Fair Contracts. - Matteo Castiglioni; Junjie Chen; Yingkai Li (CoRR, 2025)

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