Teaching

2023, ITI 1121 A — Introduction to Computing II: Website, Code written in class (on BrightSpace) 

Research interests

Online learning and optimization, bandits, pricing

Interested in a Master's or Ph.D. under my supervision?

Apply here!

Publications

For a full list, see google scholar

Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, and Stefano Leonardi
Repeated Bilateral Trade Against a Smoothed Adversary (Cite: BibTeX)
In The Thirty Sixth Annual Conference on Learning Theory, pp. 1095-1130, PMLR, 2023.

Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug
Learning the Stackelberg Equilibrium in a Newsvendor Game (Cite: BibTeX)
In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, pp. 242-250, 2023

Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Bilateral Trade: A Regret Minimization Perspective  (Cite: BibTeX)
Mathematics of Operations Research (MOR), 0(0):1−33, 2023

Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Claudio Gentile,  Yishay Mansour
Nonstochastic Bandits with Composite Anonymous Feedback (Cite: BibTeX)
Journal of Machine Learning Research (JMLR), 23(277):1−24, 2022

Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
A Regret Analysis of Bilateral Trade (Cite: BibTeX)
Proceedings of the 22nd ACM Conference on Economics and Computation (EC '21), 289-309, 2021

François Bachoc, Tommaso Cesari, Sébastien Gerchinovitz
The Sample Complexity of Level Set Approximation (Cite: BibTeX)
Proceedings of The 24th International Conference on Artificial Intelligence and Statistics (AISTATS 2021), PMLR 130:424-432, 2021

Tommaso Cesari, Roberto Colomboni
A nearest neighbor characterization of Lebesgue points in metric measure spaces (Cite: BibTeX)
Mathematical Statistics and Learning (MSL), 3(1), 71-112, 2021

Riccardo Della Vecchia, Tommaso Cesari
An Efficient Algorithm for Cooperative Semi-Bandits (Cite: BibTeX)
Proceedings of the 32nd International Conference on Algorithmic Learning Theory (ALT 2021), PMLR 132:529-552, 2021

Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour, Vianney Perchet
ROI Maximization in Stochastic Online Decision-Making (Cite: BibTeX)
Advances in Neural Information Processing Systems, 2021, 34: 9152-9166

François Bachoc, Tommaso Cesari, Sébastien Gerchinovitz
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates (Cite: BibTeX)
Advances in Neural Information Processing Systems (NeurIPS), 34: 24180-24192, 2021

Nicolò Cesa-Bianchi, Tommaso Cesari, Claire Monteleoni
Cooperative Online Learning: Keeping your Neighbors Updated  (Cite: BibTeX)
Proceedings of the 31st International Conference on Algorithmic Learning Theory (ALT 2020), PMLR 117:234-250, 2020

Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet
Dynamic Pricing with Finitely Many Unknown Valuations (Cite: BibTeX)
Proceedings of the 30th International Conference on Algorithmic Learning Theory (ALT 2019), PMLR 98:247-273, 2019