default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Emanuele Stradi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j2]Francesco Emanuele Stradi, Anna Lunghi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Policy optimization for CMDPs with bandit feedback: Best-of-both-worlds and beyond. Adv. Eng. Informatics 76: 104589 (2026)- [j1]Francesco Emanuele Stradi, Anna Lunghi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Policy optimization for CMDPs with bandit feedback: Best-of-both-worlds and beyond. Artif. Intell. 358: 104589 (2026) - [c10]Francesco Emanuele Stradi, Kalana Kalupahana, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Truly Adapting to Adversarial Constraints in Constrained MABs. COLT 2026: 6075-6113 - [i15]Francesco Emanuele Stradi, Kalana Kalupahana, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Truly Adapting to Adversarial Constraints in Constrained MABs. CoRR abs/2602.14543 (2026) - [i14]Matteo Bollini, Gianmarco Genalti, Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi:
Replicable Constrained Bandits. CoRR abs/2602.14580 (2026) - [i13]Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Francesco Emanuele Stradi:
Multi-Armed Bandits With Best-Action Queries. CoRR abs/2605.08287 (2026) - [i12]Kalana Kalupahana, Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi:
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time. CoRR abs/2605.08290 (2026) - [i11]Eleonora Fidelia Chiefari, Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi:
Online Resource Allocation With General Constraints. CoRR abs/2605.10519 (2026) - 2025
- [c9]Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization. ICLR 2025 - [c8]Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Learning Adversarial MDPs with Stochastic Hard Constraints. ICML 2025 - [c7]Francesco Emanuele Stradi, Anna Lunghi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Policy Optimization for CMDPs with Bandit Feedback: Learning Stochastic and Adversarial Constraints. ICML 2025 - [c6]Francesco Bacchiocchi, Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Markov Persuasion Processes: Learning to Persuade From Scratch. NeurIPS 2025 - [c5]Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Christian Kroer:
No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need! NeurIPS 2025 - [i10]Gianmarco Genalti, Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Data-Dependent Regret Bounds for Constrained MABs. CoRR abs/2505.20010 (2025) - [i9]Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Christian Kroer:
No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need! CoRR abs/2506.13244 (2025) - [i8]Francesco Emanuele Stradi, Eleonora Fidelia Chiefari, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Beyond Slater's Condition in Online CMDPs with Stochastic and Adversarial Constraints. CoRR abs/2509.20114 (2025) - 2024
- [c4]Davide Maran, Pierriccardo Olivieri, Francesco Emanuele Stradi, Giuseppe Urso, Nicola Gatti, Marcello Restelli:
Online Markov Decision Processes Configuration with Continuous Decision Space. AAAI 2024: 14315-14322 - [c3]Francesco Emanuele Stradi, Jacopo Germano, Gianmarco Genalti, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints. ICML 2024: 46692-46721 - [c2]Francesco Bacchiocchi, Francesco Emanuele Stradi, Matteo Papini, Alberto Maria Metelli, Nicola Gatti:
Online Learning with Off-Policy Feedback in Adversarial MDPs. IJCAI 2024: 3697-3705 - [c1]Davide Maran, Francesco Bacchiocchi, Francesco Emanuele Stradi, Matteo Castiglioni, Nicola Gatti, Marcello Restelli:
Bandits with Ranking Feedback. NeurIPS 2024 - [i7]Francesco Bacchiocchi, Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Markov Persuasion Processes: Learning to Persuade from Scratch. CoRR abs/2402.03077 (2024) - [i6]Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti:
Learning Adversarial MDPs with Stochastic Hard Constraints. CoRR abs/2403.03672 (2024) - [i5]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) - [i4]Francesco Emanuele Stradi, Filippo Cipriani, Lorenzo Ciampiconi, Marco Leonardi, Alessandro Rozza, Nicola Gatti:
A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints. CoRR abs/2407.05793 (2024) - [i3]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) - [i2]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) - 2023
- [i1]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)
Coauthor Index
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 2026-07-30 23:18 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
