default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTommaso Cesari
Person information
- affiliation: Toulouse School of Economics (TSE), Toulouse, France
- affiliation (PhD 2020): University of Milan (UniMi), Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2020
[b1]Tommaso Renato Cesari:
ALGORITHMS, LEARNING, AND OPTIMIZATION. University of Milan, Italy, 2020
Journal Articles
- 2024
- [j4]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Regret Analysis of Bilateral Trade with a Smoothed Adversary. J. Mach. Learn. Res. 25: 234:1-234:36 (2024) - [j3]Nicolò Cesa-Bianchi
, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Bilateral Trade: A Regret Minimization Perspective. Math. Oper. Res. 49(1): 171-203 (2024) - [j2]Nicolò Cesa-Bianchi, Tommaso Cesari, Riccardo Della Vecchia:
Cooperative Online Learning with Feedback Graphs. Trans. Mach. Learn. Res. 2024 (2024) - 2022
- [j1]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Claudio Gentile, Yishay Mansour:
Nonstochastic Bandits with Composite Anonymous Feedback. J. Mach. Learn. Res. 23: 277:1-277:24 (2022)
Conference and Workshop Papers
- 2024
- [c12]Natasa Bolic, Tommaso Cesari, Roberto Colomboni:
An Online Learning Theory of Brokerage. AAMAS 2024: 216-224 - [c11]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. STOC 2024: 225-236 - 2023
- [c10]Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Learning the Stackelberg Equilibrium in a Newsvendor Game. AAMAS 2023: 242-250 - [c9]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. COLT 2023: 1095-1130 - [c8]Khaled Eldowa, Emmanuel Esposito, Tommaso Cesari, Nicolò Cesa-Bianchi:
On the Minimax Regret for Online Learning with Feedback Graphs. NeurIPS 2023 - 2021
- [c7]François Bachoc, Tommaso Cesari, Sébastien Gerchinovitz:
The Sample Complexity of Level Set Approximation. AISTATS 2021: 424-432 - [c6]Riccardo Della Vecchia, Tommaso Cesari:
An Efficient Algorithm for Cooperative Semi-Bandits. ALT 2021: 529-552 - [c5]Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour, Vianney Perchet:
A New Theoretical Framework for Fast and Accurate Online Decision-Making. NeurIPS 2021: 9152-9166 - [c4]François Bachoc, Tommaso Cesari, Sébastien Gerchinovitz:
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates. NeurIPS 2021: 24180-24192 - [c3]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
A Regret Analysis of Bilateral Trade. EC 2021: 289-309 - 2020
- [c2]Nicolò Cesa-Bianchi, Tommaso Cesari, Claire Monteleoni:
Cooperative Online Learning: Keeping your Neighbors Updated. ALT 2020: 234-250 - 2019
- [c1]Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet:
Dynamic Pricing with Finitely Many Unknown Valuations. ALT 2019: 247-273
Informal and Other Publications
- 2024
- [i22]Tommaso Cesari, Roberto Colomboni:
Trading Volume Maximization with Online Learning. CoRR abs/2405.13102 (2024) - [i21]François Bachoc, Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni:
Fair Online Bilateral Trade. CoRR abs/2405.13919 (2024) - [i20]François Bachoc, Tommaso Cesari, Roberto Colomboni:
A Contextual Online Learning Theory of Brokerage. CoRR abs/2407.01566 (2024) - 2023
- [i19]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. CoRR abs/2302.10805 (2023) - [i18]Khaled Eldowa, Emmanuel Esposito, Tommaso Cesari, Nicolò Cesa-Bianchi:
On the Minimax Regret for Online Learning with Feedback Graphs. CoRR abs/2305.15383 (2023) - [i17]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. CoRR abs/2307.09478 (2023) - [i16]Natasa Bolic, Tommaso Cesari, Roberto Colomboni:
An Online Learning Theory of Brokerage. CoRR abs/2310.12107 (2023) - 2022
- [i15]Tommaso Cesari, Jonathan Pergoli, Michele Maestrini, Pierluigi Di Lizia:
An Application of Online Learning to Spacecraft Memory Dump Optimization. CoRR abs/2202.06617 (2022) - [i14]Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Online Learning in Supply-Chain Games. CoRR abs/2207.04054 (2022) - [i13]François Bachoc, Tommaso Cesari, Roberto Colomboni, Andrea Paudice:
A Near-Optimal Algorithm for Univariate Zeroth-Order Budget Convex Optimization. CoRR abs/2208.06720 (2022) - [i12]François Bachoc, Tommaso Cesari, Roberto Colomboni, Andrea Paudice:
Regret Analysis of Dyadic Search. CoRR abs/2209.00885 (2022) - 2021
- [i11]François Bachoc, Tommaso Renato Cesari, Sébastien Gerchinovitz:
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates. CoRR abs/2102.01977 (2021) - [i10]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
A Regret Analysis of Bilateral Trade. CoRR abs/2102.08754 (2021) - [i9]Nicolò Cesa-Bianchi, Tommaso Cesari, Riccardo Della Vecchia:
Cooperative Online Learning with Feedback Graphs. CoRR abs/2106.04982 (2021) - [i8]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Bilateral Trade: A Regret Minimization Perspective. CoRR abs/2109.12974 (2021) - [i7]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Claudio Gentile, Yishay Mansour:
Nonstochastic Bandits with Composite Anonymous Feedback. CoRR abs/2112.02866 (2021) - 2020
- [i6]Clément Bouttier, Tommaso Cesari, Sébastien Gerchinovitz:
Regret analysis of the Piyavskii-Shubert algorithm for global Lipschitz optimization. CoRR abs/2002.02390 (2020) - [i5]Tommaso Cesari, Roberto Colomboni:
A Nearest Neighbor Characterization of Lebesgue Points in Metric Measure Spaces. CoRR abs/2007.03937 (2020) - [i4]Riccardo Della Vecchia, Tommaso Cesari:
An Efficient Algorithm for Cooperative Semi-Bandits. CoRR abs/2010.01818 (2020) - 2019
- [i3]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Claire Monteleoni:
Cooperative Online Learning: Keeping your Neighbors Updated. CoRR abs/1901.08082 (2019) - [i2]Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour, Vianney Perchet:
Repeated A/B Testing. CoRR abs/1905.11797 (2019) - 2018
- [i1]Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet:
Dynamic Pricing with Finitely Many Unknown Valuations. CoRR abs/1807.03288 (2018)
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-09-18 01:09 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:
