Tommaso Cesari

Orcid: 0000-0001-5010-1094

Affiliations:
  • Toulouse School of Economics (TSE), Toulouse, France
  • University of Milan (UniMi), Italy (PhD 2020)


According to our database1, Tommaso Cesari authored at least 23 papers between 2019 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An Online Learning Theory of Brokerage.
CoRR, 2023

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations.
CoRR, 2023

On the Minimax Regret for Online Learning with Feedback Graphs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Repeated Bilateral Trade Against a Smoothed Adversary.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Learning the Stackelberg Equilibrium in a Newsvendor Game.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Nonstochastic Bandits with Composite Anonymous Feedback.
J. Mach. Learn. Res., 2022

Regret Analysis of Dyadic Search.
CoRR, 2022

A Near-Optimal Algorithm for Univariate Zeroth-Order Budget Convex Optimization.
CoRR, 2022

Online Learning in Supply-Chain Games.
CoRR, 2022

An Application of Online Learning to Spacecraft Memory Dump Optimization.
CoRR, 2022

2021
Bilateral Trade: A Regret Minimization Perspective.
CoRR, 2021

Cooperative Online Learning with Feedback Graphs.
CoRR, 2021

A Regret Analysis of Bilateral Trade.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

A New Theoretical Framework for Fast and Accurate Online Decision-Making.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

An Efficient Algorithm for Cooperative Semi-Bandits.
Proceedings of the Algorithmic Learning Theory, 2021

The Sample Complexity of Level Set Approximation.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
ALGORITHMS, LEARNING, AND OPTIMIZATION.
PhD thesis, 2020

A Nearest Neighbor Characterization of Lebesgue Points in Metric Measure Spaces.
CoRR, 2020

Regret analysis of the Piyavskii-Shubert algorithm for global Lipschitz optimization.
CoRR, 2020

Cooperative Online Learning: Keeping your Neighbors Updated.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Repeated A/B Testing.
CoRR, 2019

Dynamic Pricing with Finitely Many Unknown Valuations.
Proceedings of the Algorithmic Learning Theory, 2019


  Loading...