default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartino Bernasconi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j1]Martino Bernasconi, Federico Cacciamani, Matteo Castiglioni:
A framework for safe decision making: A convex duality approach. Intelligenza Artificiale 17(2): 195-205 (2023)
Conference and Workshop Papers
- 2024
- [c14]Martino Bernasconi, Alberto Marchesi, Francesco Trovò:
Learning Extensive-Form Perfect Equilibria in Two-Player Zero-Sum Sequential Games. AISTATS 2024: 2152-2160 - [c13]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
Bandits with Replenishable Knapsacks: the Best of both Worlds. ICLR 2024 - [c12]Martino Bernasconi
, Matteo Castiglioni, Andrea Celli, Federico Fusco:
No-Regret Learning in Bilateral Trade via Global Budget Balance. STOC 2024: 247-258 - 2023
- [c11]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 - [c10]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Francesco Trovò, Nicola Gatti:
Constrained Phi-Equilibria. ICML 2023: 2184-2205 - [c9]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Mirco Mutti:
Persuading Farsighted Receivers in MDPs: the Power of Honesty. NeurIPS 2023 - [c8]Tommaso Paladini, Martino Bernasconi de Luca, Michele Carminati, Mario Polino, Francesco Trovò, Stefano Zanero:
Advancing Fraud Detection Systems Through Online Learning. ECML/PKDD (6) 2023: 275-292 - 2022
- [c7]Martino Bernasconi, Federico Cacciamani, Simone Fioravanti, Nicola Gatti, Francesco Trovò:
The Evolutionary Dynamics of Soft-Max Policy Gradient in Multi-Agent Settings. AAMAS 2022: 1545-1547 - [c6]Martino Bernasconi, Stefano Martino, Edoardo Vittori, Francesco Trovò, Marcello Restelli:
Dark-Pool Smart Order Routing: a Combinatorial Multi-armed Bandit Approach. ICAIF 2022: 352-360 - [c5]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 - [c4]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Francesco Trovò:
Sequential Information Design: Learning to Persuade in the Dark. NeurIPS 2022 - 2021
- [c3]Martino Bernasconi de Luca, Federico Cacciamani, Simone Fioravanti, Nicola Gatti, Alberto Marchesi, Francesco Trovò:
Exploiting Opponents Under Utility Constraints in Sequential Games. NeurIPS 2021: 13177-13188 - [c2]Martino Bernasconi de Luca, Edoardo Vittori, Francesco Trovò, Marcello Restelli:
Conservative Online Convex Optimization. ECML/PKDD (1) 2021: 19-34 - 2020
- [c1]Edoardo Vittori, Martino Bernasconi de Luca, Francesco Trovò, Marcello Restelli:
Dealing with transaction costs in portfolio optimization: online gradient descent with momentum. ICAIF 2020: 11:1-11:8
Informal and Other Publications
- 2024
- [i13]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi:
Regret-Minimizing Contracts: Agency Under Uncertainty. CoRR abs/2402.13156 (2024) - [i12]Federico Cacciamani, Martino Bernasconi, Matteo Castiglioni, Nicola Gatti:
Multi-Agent Contract Design beyond Binary Actions. CoRR abs/2402.13824 (2024) - [i11]Martino Bernasconi, Matteo Castiglioni, Andrea Celli:
Agent-Designed Contracts: How to Sell Hidden Actions. CoRR abs/2402.16547 (2024) - [i10]Martino Bernasconi, Matteo Castiglioni, Andrea Celli:
No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization. CoRR abs/2405.06575 (2024) - [i9]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints. CoRR abs/2405.16118 (2024) - [i8]Solenne Gaucher, Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Vianney Perchet:
Feature-Based Online Bilateral Trade. CoRR abs/2405.18183 (2024) - 2023
- [i7]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Francesco Trovò, Nicola Gatti:
Constrained Phi-Equilibria. CoRR abs/2301.13600 (2023) - [i6]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) - [i5]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
Bandits with Replenishable Knapsacks: the Best of both Worlds. CoRR abs/2306.08470 (2023) - [i4]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Mirco Mutti:
Persuading Farsighted Receivers in MDPs: the Power of Honesty. CoRR abs/2306.12221 (2023) - [i3]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
No-Regret Learning in Bilateral Trade via Global Budget Balance. CoRR abs/2310.12370 (2023) - 2022
- [i2]Martino Bernasconi, Alberto Marchesi, Francesco Trovò:
Last-iterate Convergence to Trembling-hand Perfect Equilibria. CoRR abs/2208.08238 (2022) - [i1]Martino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Nicola Gatti, Francesco Trovò:
Sequential Information Design: Learning to Persuade in the Dark. CoRR abs/2209.03927 (2022)
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 2024-08-08 20:12 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
