Matteo Castiglioni

CoRR, July, 2025

Fair Contracts.

[BibT_eX]

[DOI]

Junjie Chen

Yingkai Li

CoRR, July, 2025

No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!

[BibT_eX]

[DOI]

CoRR, June, 2025

The Complexity of Correlated Equilibria in Generalized Games.

[BibT_eX]

[DOI]

CoRR, June, 2025

Data-Dependent Regret Bounds for Constrained MABs.

[BibT_eX]

[DOI]

Gianmarco Genalti

CoRR, May, 2025

Online Two-Sided Markets: Many Buyers Enhance Learning.

[BibT_eX]

[DOI]

Anna Lunghi

CoRR, March, 2025

Contract Design Under Approximate Best Responses.

[BibT_eX]

[DOI]

CoRR, February, 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

Learning optimal contracts with small action spaces.

[BibT_eX]

[DOI]

Artif. Intell., 2025

A Reduction from Multi-Parameter to Single-Parameter Bayesian Contract Design.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Hiring for An Uncertain Task: Joint Design of Information and Contracts.

[BibT_eX]

[DOI]

Junjie Chen

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Multi-Project Contracts.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Safe Online Bid Optimization with Return on Investment and Budget Constraints.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, V.1, 2025

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Feature-Based Online Bilateral Trade.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

The Sample Complexity of Stackelberg Games.

[BibT_eX]

[DOI]

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

2024

Maximizing Revenue From Selfish Agents in Crowd Tasks: Indirect Incentive Strategies.

[BibT_eX]

[DOI]

IEEE Control. Syst. Lett., 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

Contracting With a Reinforcement Learning Agent by Playing Trick or Treat.

[BibT_eX]

[DOI]

Matteo Bollini

CoRR, 2024

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback.

[BibT_eX]

[DOI]

CoRR, 2024

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting.

[BibT_eX]

[DOI]

Alberto Maria Metelli

CoRR, 2024

Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints.

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

Learning Adversarial MDPs with Stochastic Hard Constraints.

[BibT_eX]

[DOI]

CoRR, 2024

Regret-Minimizing Contracts: Agency Under Uncertainty.

[BibT_eX]

[DOI]

CoRR, 2024

Markov Persuasion Processes: Learning to Persuade from Scratch.

[BibT_eX]

[DOI]

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

Bandits with Ranking Feedback.

[BibT_eX]

[DOI]

Davide Maran

Marcello Restelli

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

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

[BibT_eX]

[DOI]

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

Online Bayesian Persuasion Without a Clue.

[BibT_eX]

[DOI]

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

Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Graph-Triggered Rising Bandits.

[BibT_eX]

[DOI]

Alberto Maria Metelli

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Online Learning under Budget and ROI Constraints via Weak Adaptivity.

[BibT_eX]

[DOI]

Christian Kroer

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Online Information Acquisition: Hiring Multiple Agents.

[BibT_eX]

[DOI]

Federico Cacciamani

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Bandits with Replenishable Knapsacks: the Best of both Worlds.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Learning Optimal Contracts: How to Exploit Small Action Spaces.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Finding Effective Ad Allocations: How to Exploit User History.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Increasing revenue in Bayesian posted price auctions through signaling.

[BibT_eX]

[DOI]

Artif. Intell., October, 2023

Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive.

[BibT_eX]

[DOI]

Algorithmica, September, 2023

Designing menus of contracts efficiently: The power of randomization.

[BibT_eX]

[DOI]

Artif. Intell., May, 2023

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

[BibT_eX]

[DOI]

Federico Cacciamani

Intelligenza Artificiale, 2023

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints.

[BibT_eX]

[DOI]

Jacopo Germano

CoRR, 2023

Online Bidding in Repeated Non-Truthful Auctions under Budget and ROI Constraints.

[BibT_eX]

[DOI]

Christian Kroer

CoRR, 2023

Selling Information while Being an Interested Party.

[BibT_eX]

[DOI]

Giulia Romano

CoRR, 2023

Multi-Agent Contract Design: How to Commission Multiple Agents with Individual Outcome.

[BibT_eX]

[DOI]

CoRR, 2023

Regret minimization in online Bayesian persuasion: Handling adversarial receiver's types under full and partial feedback models.

[BibT_eX]

[DOI]

Artif. Intell., 2023

Multi-Agent Contract Design: How to Commission Multiple Agents with Individual Outcomes.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 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

Online Mechanism Design for Information Acquisition.

[BibT_eX]

[DOI]

Federico Cacciamani

Proceedings of the International Conference on Machine Learning, 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

Reducing the gap between theory and applications in algorithmic Bayesian persuasion.

[BibT_eX]

[DOI]

PhD thesis, 2022

Safe Online Bid Optimization with Return-On-Investment and Budget Constraints subject to Uncertainty.

[BibT_eX]

[DOI]

CoRR, 2022

Bayesian agency: Linear versus tractable contracts.

[BibT_eX]

[DOI]

Artif. Intell., 2022

A Unifying Framework for Online Optimization with Long-Term Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 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

The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Public Signaling in Bayesian Ad Auctions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 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

Online Learning with Knapsacks: the Best of Both Worlds.

[BibT_eX]

[DOI]

Christian Kroer

Proceedings of the International Conference on Machine Learning, 2022

Bayesian Persuasion Meets Mechanism Design: Going Beyond Intractability with Type Reporting.

[BibT_eX]

[DOI]

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

Signaling in Posted Price Auctions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Efficiency of Ad Auctions with Price Displaying.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Election Manipulation on Social Networks: Seeding, Edge Removal, Edge Addition.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

Committing to correlated strategies with multiple leaders.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Multi-Receiver Online Bayesian Persuasion.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Persuading Voters in District-based Elections.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Election Manipulation on Social Networks with Messages on Multiple Candidates Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy AI - Integrating Learning, Optimization and Reasoning, 2020

Online Bayesian Persuasion.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Election Control in Social Networks via Edge Addition or Removal.

[BibT_eX]

[DOI]

Diodato Ferraioli

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2019

Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2019

Election Manipulation on Social Networks with Messages on Multiple Candidates.

[BibT_eX]

[DOI]

CoRR, 2019

Leadership in singleton congestion games: What is hard and what is easy.

[BibT_eX]

[DOI]

Artif. Intell., 2019

Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders.

[BibT_eX]

[DOI]