default search action
Matteo Castiglioni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j11]Martino Bernasconi
, Matteo Castiglioni
Online learning in sequential Bayesian persuasion: Handling unknown priors. Artif. Intell. 338: 104245 (2025) - 2024
- [j10]Mina Montazeri
Maximizing Revenue From Selfish Agents in Crowd Tasks: Indirect Incentive Strategies. IEEE Control. Syst. Lett. 8: 2295-2300 (2024) - [c35]Matteo Castiglioni, Alberto Latino, Alberto Marchesi, Giulia Romano, Nicola Gatti, Chokha Palayamkottai:
Finding Effective Ad Allocations: How to Exploit User History. AAMAS 2024: 262-270 - [c34]Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Learning Optimal Contracts: How to Exploit Small Action Spaces. ICLR 2024 - [c33]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
Bandits with Replenishable Knapsacks: the Best of both Worlds. ICLR 2024 - [c32]Federico Cacciamani, Matteo Castiglioni, Nicola Gatti:
Online Information Acquisition: Hiring Multiple Agents. ICLR 2024 - [c31]Matteo Castiglioni, Andrea Celli, Christian Kroer:
Online Learning under Budget and ROI Constraints via Weak Adaptivity. ICML 2024 - [c30]Gianmarco Genalti, Marco Mussi, Nicola Gatti, Marcello Restelli, Matteo Castiglioni, Alberto Maria Metelli:
Graph-Triggered Rising Bandits. ICML 2024 - [c29]Francesco Emanuele Stradi, Jacopo Germano, Gianmarco Genalti, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints. ICML 2024 - [c28]Martino Bernasconi
Agent-Designed Contracts: How to Sell Hidden Actions. EC 2024: 312 - [c27]Federico Cacciamani
Multi-Agent Contract Design beyond Binary Actions. EC 2024: 1293 - [c26]Martino Bernasconi
No-Regret Learning in Bilateral Trade via Global Budget Balance. STOC 2024: 247-258 - [i49]Francesco Bacchiocchi, Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Markov Persuasion Processes: Learning to Persuade from Scratch. CoRR abs/2402.03077 (2024) - [i48]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi:
Regret-Minimizing Contracts: Agency Under Uncertainty. CoRR abs/2402.13156 (2024) - [i47]Federico Cacciamani, Martino Bernasconi, Matteo Castiglioni, Nicola Gatti:
Multi-Agent Contract Design beyond Binary Actions. CoRR abs/2402.13824 (2024) - [i46]Martino Bernasconi, Matteo Castiglioni, Andrea Celli:
Agent-Designed Contracts: How to Sell Hidden Actions. CoRR abs/2402.16547 (2024) - [i45]Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Learning Adversarial MDPs with Stochastic Hard Constraints. CoRR abs/2403.03672 (2024) - [i44]Matteo Castiglioni, Junjie Chen, Minming Li, Haifeng Xu, Song Zuo:
A Reduction from Multi-Parameter to Single-Parameter Bayesian Contract Design. CoRR abs/2404.03476 (2024) - [i43]Martino Bernasconi, Matteo Castiglioni, Andrea Celli:
No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization. CoRR abs/2405.06575 (2024) - [i42]Francesco Bacchiocchi, Matteo Bollini, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
The Sample Complexity of Stackelberg Games. CoRR abs/2405.06977 (2024) - [i41]Francesco Emanuele Stradi, Anna Lunghi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints. CoRR abs/2405.14372 (2024) - [i40]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints. CoRR abs/2405.16118 (2024) - [i39]Solenne Gaucher, Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Vianney Perchet:
Feature-Based Online Bilateral Trade. CoRR abs/2405.18183 (2024) - [i38]Matteo Castiglioni, Junjie Chen:
Hiring for An Uncertain Task: Joint Design of Information and Contracts. CoRR abs/2407.05459 (2024) - [i37]Gianmarco Genalti, Marco Mussi, Nicola Gatti, Marcello Restelli, Matteo Castiglioni, Alberto Maria Metelli:
Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting. CoRR abs/2409.05980 (2024) - [i36]Francesco Emanuele Stradi, Anna Lunghi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback. CoRR abs/2410.02269 (2024) - [i35]Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization. CoRR abs/2410.02275 (2024) - [i34]Matteo Bollini, Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Contracting With a Reinforcement Learning Agent by Playing Trick or Treat. CoRR abs/2410.13520 (2024) - 2023
- [j9]Matteo Castiglioni
Regret minimization in online Bayesian persuasion: Handling adversarial receiver's types under full and partial feedback models. Artif. Intell. 314: 103821 (2023) - [j8]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti
Designing menus of contracts efficiently: The power of randomization. Artif. Intell. 318: 103881 (2023) - [j7]Matteo Castiglioni, Alberto Marchesi, Giulia Romano, Nicola Gatti
Increasing revenue in Bayesian posted price auctions through signaling. Artif. Intell. 323: 103990 (2023) - [j6]Matteo Castiglioni, Andrea Celli, Nicola Gatti
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive. Algorithmica 85(9): 2885-2921 (2023) - [j5]Martino Bernasconi, Federico Cacciamani, Matteo Castiglioni:
A framework for safe decision making: A convex duality approach. Intelligenza Artificiale 17(2): 195-205 (2023) - [c25]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Francesco Trovò, Nicola Gatti:
Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion. ICML 2023: 2164-2183 - [c24]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Francesco Trovò, Nicola Gatti:
Constrained Phi-Equilibria. ICML 2023: 2184-2205 - [c23]Federico Cacciamani, Matteo Castiglioni, Nicola Gatti:
Online Mechanism Design for Information Acquisition. ICML 2023: 3299-3326 - [c22]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Mirco Mutti:
Persuading Farsighted Receivers in MDPs: the Power of Honesty. NeurIPS 2023 - [c21]Matteo Castiglioni
Multi-Agent Contract Design: How to Commission Multiple Agents with Individual Outcomes. EC 2023: 412-448 - [e1]Riccardo De Benedictis, Matteo Castiglioni, Diodato Ferraioli, Vadim Malvone, Marco Maratea, Enrico Scala, Luciano Serafini, Ivan Serina, Elisa Tosello, Alessandro Umbrico, Mauro Vallati:
Proceedings of the the Italian Workshop on Planning and Scheduling, RCRA Workshop on Experimental evaluation of algorithms for solving problems with combinatorial explosion, and SPIRIT Workshop on Strategies, Prediction, Interaction, and Reasoning in Italy (IPS-RCRA-SPIRIT 2023) co-located with 22nd International Conference of the Italian Association for Artificial Intelligence AIxIA 2023, November 7-9th, 2023, Rome, Italy. CEUR Workshop Proceedings 3585, CEUR-WS.org 2023 [contents] - [i33]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Francesco Trovò, Nicola Gatti:
Constrained Phi-Equilibria. CoRR abs/2301.13600 (2023) - [i32]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Multi-Agent Contract Design: How to Commission Multiple Agents with Individual Outcome. CoRR abs/2301.13654 (2023) - [i31]Matteo Castiglioni, Francesco Bacchiocchi, Alberto Marchesi, Giulia Romano, Nicola Gatti:
Selling Information while Being an Interested Party. CoRR abs/2301.13790 (2023) - [i30]Matteo Castiglioni, Andrea Celli, Christian Kroer:
Online Bidding in Repeated Non-Truthful Auctions under Budget and ROI Constraints. CoRR abs/2302.01203 (2023) - [i29]Federico Cacciamani, Matteo Castiglioni, Nicola Gatti:
Online Mechanism Design for Information Acquisition. CoRR abs/2302.02873 (2023) - [i28]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola Gatti, Francesco Trovò:
Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion. CoRR abs/2303.01296 (2023) - [i27]Jacopo Germano, Francesco Emanuele Stradi, Gianmarco Genalti, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints. CoRR abs/2304.14326 (2023) - [i26]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
Bandits with Replenishable Knapsacks: the Best of both Worlds. CoRR abs/2306.08470 (2023) - [i25]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Mirco Mutti:
Persuading Farsighted Receivers in MDPs: the Power of Honesty. CoRR abs/2306.12221 (2023) - [i24]Federico Cacciamani, Matteo Castiglioni, Nicola Gatti:
Online Information Acquisition: Hiring Multiple Agents. CoRR abs/2307.06210 (2023) - [i23]Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Learning Optimal Contracts: How to Exploit Small Action Spaces. CoRR abs/2309.09801 (2023) - [i22]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco
No-Regret Learning in Bilateral Trade via Global Budget Balance. CoRR abs/2310.12370 (2023) - 2022
- [b1]Matteo Castiglioni:
Reducing the gap between theory and applications in algorithmic Bayesian persuasion. Polytechnic University of Milan, Italy, 2022 - [j4]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti
Bayesian agency: Linear versus tractable contracts. Artif. Intell. 307: 103684 (2022) - [c20]Matteo Castiglioni, Diodato Ferraioli, Nicola Gatti, Alberto Marchesi, Giulia Romano:
Efficiency of Ad Auctions with Price Displaying. AAAI 2022: 4933-4940 - [c19]Matteo Castiglioni, Giulia Romano, Alberto Marchesi, Nicola Gatti:
Signaling in Posted Price Auctions. AAAI 2022: 4941-4948 - [c18]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Bayesian Persuasion Meets Mechanism Design: Going Beyond Intractability with Type Reporting. AAMAS 2022: 226-234 - [c17]Martino Bernasconi, Federico Cacciamani, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Francesco Trovò:
Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints. ICML 2022: 1854-1873 - [c16]Matteo Castiglioni, Andrea Celli, Christian Kroer:
Online Learning with Knapsacks: the Best of Both Worlds. ICML 2022: 2767-2783 - [c15]Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Giulia Romano, Nicola Gatti:
Public Signaling in Bayesian Ad Auctions. IJCAI 2022: 39-45 - [c14]Giulia Romano, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding. IJCAI 2022: 461-467 - [c13]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Francesco Trovò:
Sequential Information Design: Learning to Persuade in the Dark. NeurIPS 2022 - [c12]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Giulia Romano, Nicola Gatti:
A Unifying Framework for Online Optimization with Long-Term Constraints. NeurIPS 2022 - [c11]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Designing Menus of Contracts Efficiently: The Power of Randomization. EC 2022: 705-735 - [i21]Matteo Castiglioni, Alessandro Nuara, Giulia Romano, Giorgio Spadaro, Francesco Trovò, Nicola Gatti:
Safe Online Bid Optimization with Return-On-Investment and Budget Constraints subject to Uncertainty. CoRR abs/2201.07139 (2022) - [i20]Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Giulia Romano, Nicola Gatti:
Public Signaling in Bayesian Ad Auctions. CoRR abs/2201.09728 (2022) - [i19]Matteo Castiglioni, Giulia Romano, Alberto Marchesi, Nicola Gatti:
Signaling in Posted Price Auctions. CoRR abs/2201.12183 (2022) - [i18]Matteo Castiglioni, Diodato Ferraioli, Nicola Gatti, Alberto Marchesi, Giulia Romano:
Efficiency of Ad Auctions with Price Displaying. CoRR abs/2201.12275 (2022) - [i17]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Bayesian Persuasion Meets Mechanism Design: Going Beyond Intractability with Type Reporting. CoRR abs/2202.00605 (2022) - [i16]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Designing Menus of Contracts Efficiently: The Power of Randomization. CoRR abs/2202.10966 (2022) - [i15]Matteo Castiglioni, Andrea Celli, Christian Kroer:
Online Learning with Knapsacks: the Best of Both Worlds. CoRR abs/2202.13710 (2022) - [i14]Giulia Romano, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding. CoRR abs/2204.13772 (2022) - [i13]Martino Bernasconi
Sequential Information Design: Learning to Persuade in the Dark. CoRR abs/2209.03927 (2022) - [i12]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Giulia Romano, Nicola Gatti:
A Unifying Framework for Online Optimization with Long-Term Constraints. CoRR abs/2209.07454 (2022) - 2021
- [j3]Matteo Castiglioni
Committing to correlated strategies with multiple leaders. Artif. Intell. 300: 103549 (2021) - [j2]Matteo Castiglioni, Diodato Ferraioli, Nicola Gatti, Giulia Landriani:
Election Manipulation on Social Networks: Seeding, Edge Removal, Edge Addition. J. Artif. Intell. Res. 71: 1049-1090 (2021) - [c10]Matteo Castiglioni, Nicola Gatti:
Persuading Voters in District-based Elections. AAAI 2021: 5244-5251 - [c9]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry. AAAI 2021: 5252-5259 - [c8]Matteo Castiglioni, Alberto Marchesi, Andrea Celli, Nicola Gatti:
Multi-Receiver Online Bayesian Persuasion. ICML 2021: 1314-1323 - [c7]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Bayesian Agency: Linear versus Tractable Contracts. EC 2021: 285-286 - [i11]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Bayesian Agency: Linear versus Tractable Contracts. CoRR abs/2106.00319 (2021) - [i10]Matteo Castiglioni, Alberto Marchesi, Andrea Celli, Nicola Gatti:
Multi-Receiver Online Bayesian Persuasion. CoRR abs/2106.06480 (2021) - 2020
- [c6]Matteo Castiglioni, Andrea Celli, Nicola Gatti:
Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud. AAAI 2020: 1870-1877 - [c5]Matteo Castiglioni, Diodato Ferraioli, Nicola Gatti:
Election Control in Social Networks via Edge Addition or Removal. AAAI 2020: 1878-1885 - [c4]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Online Bayesian Persuasion. NeurIPS 2020 - [c3]Matteo Castiglioni, Diodato Ferraioli, Nicola Gatti, Giulia Landriani:
Election Manipulation on Social Networks with Messages on Multiple Candidates Extended Abstract. TAILOR 2020: 205-211 - [i9]Matteo Castiglioni, Andrea Celli, Nicola Gatti:
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive. CoRR abs/2002.05156 (2020) - [i8]Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry. CoRR abs/2002.05190 (2020) - [i7]Matteo Castiglioni, Nicola Gatti:
Persuading Voters in District-based Elections. CoRR abs/2012.05002 (2020)
2010 – 2019
- 2019
- [j1]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Stefano Coniglio
Leadership in singleton congestion games: What is hard and what is easy. Artif. Intell. 277 (2019) - [c2]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders. IJCAI 2019: 123-129 - [c1]Alberto Marchesi, Matteo Castiglioni, Nicola Gatti:
Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions. IJCAI 2019: 485-491 - [i6]Matteo Castiglioni, Diodato Ferraioli, Giulia Landriani, Nicola Gatti:
Election Manipulation on Social Networks with Messages on Multiple Candidates. CoRR abs/1902.03779 (2019) - [i5]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders (Extended Version). CoRR abs/1905.13106 (2019) - [i4]Alberto Marchesi, Matteo Castiglioni, Nicola Gatti:
Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions (Extended Version). CoRR abs/1905.13108 (2019) - [i3]Matteo Castiglioni, Andrea Celli, Nicola Gatti:
Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud. CoRR abs/1908.10620 (2019) - [i2]Matteo Castiglioni, Diodato Ferraioli, Nicola Gatti:
Election Control in Social Networks via Edge Addition or Removal. CoRR abs/1911.06198 (2019) - 2018
- [i1]Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Stefano Coniglio:
Leadership in Singleton Congestion Games: What is Hard and What is Easy. CoRR abs/1808.10209 (2018)
Coauthor Index
[j11] [j10] [c35] [c34] [c32] [c30] [c29] [c27] [i49] [i47] [i45] [i42] [i41] [i37] [i36] [i35] [i34] [j9] [j8] [j7] [j6] [c25] [c24] [c23] [c21] [i33] [i32] [i31] [i29] [i28] [i27] [i24] [i23] [j4] [c20] [c19] [c18] [c17] [c15] [c14] [c13] [c12] [c11] [i21] [i20] [i19] [i18] [i17] [i16] [i14] [i13] [i12] [j3] [j2] [c10] [c9] [c8] [c7] [i11] [i10] [c6] [c5] [c4] [c3] [i9] [i8] [i7] [j1] [c2] [c1] [i6] [i5] [i4] [i3] [i2] [i1]
[j11] [c35] [c34] [c29] [i49] [i48] [i45] [i42] [i41] [i36] [i35] [i34] [j9] [j8] [j7] [c25] [c24] [c22] [c21] [i33] [i32] [i31] [i28] [i27] [i25] [i23] [j4] [c20] [c19] [c18] [c17] [c15] [c14] [c13] [c12] [c11] [i20] [i19] [i18] [i17] [i16] [i14] [i13] [i12] [j3] [c9] [c8] [c7] [i11] [i10] [c4] [i8] [j1] [c2] [c1] [i5] [i4] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: