8 citations · 40 across the 29 of their papers we have counts for
14 papers · 1 filter
An Efficient Minimax-Optimal Algorithm for Adversarial -Set Bandits
Francesco Bacchiocchi, Tommaso Cesari, Roberto Colomboni
We study adversarial combinatorial bandits with -set actions, where at each round the learner selects out of items and observes only the aggregate loss of the selected i…
Two-Action Apple Tasting with Switching Costs
Tommaso Cesari, Roberto Colomboni
We study the two-action apple-tasting problem with switching costs against an oblivious adversary. In an equivalent normalized formulation, at each round the learner chooses betwee…
Optimal Gap-Dependent Regret for Private Stochastic Decision-Theoretic Online Learning
Tommaso Cesari, Roberto Colomboni
We study stochastic decision-theoretic online learning with full information and event-level pure differential privacy. A COLT open problem of Hu and Mehta asks to determine the op…
An Online Learning Theory of Brokerage
Nataša Bolić, Tommaso Cesari, Roberto Colomboni
We investigate brokerage between traders from an online learning perspective. At any round , two traders arrive with their private valuations, and the broker proposes a trading…
On the Minimax Regret for Online Learning with Feedback Graphs
Khaled Eldowa, Emmanuel Esposito, Tommaso Cesari +1
In this work, we improve on the upper and lower bounds for the regret of online learning with strongly observable undirected feedback graphs. The best known upper bound for this pr…
Repeated Bilateral Trade Against a Smoothed Adversary
Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni +2
We study repeated bilateral trade where an adaptive -smooth adversary generates the valuations of sellers and buyers. We provide a complete characterization of the regret regime…
Regret Analysis of Dyadic Search
François Bachoc, Tommaso Cesari, Roberto Colomboni +1
We analyze the cumulative regret of the Dyadic Search algorithm of Bachoc et al. [2022].
Cooperative Online Learning with Feedback Graphs
Nicolò Cesa-Bianchi, Tommaso R. Cesari, Riccardo Della Vecchia
We study the interplay between communication and feedback in a cooperative online learning setting, where a network of communicating agents learn a common sequential decision-makin…
A Regret Analysis of Bilateral Trade
Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni +2
Bilateral trade, a fundamental topic in economics, models the problem of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they h…
An Efficient Algorithm for Cooperative Semi-Bandits
Riccardo Della Vecchia, Tommaso Cesari
We consider the problem of asynchronous online combinatorial optimization on a network of communicating agents. At each time step, some of the agents are stochastically activated,…
A Nearest Neighbor Characterization of Lebesgue Points in Metric Measure Spaces
Tommaso Cesari, Roberto Colomboni
The property of almost every point being a Lebesgue point has proven to be crucial for the consistency of several classification algorithms based on nearest neighbors. We character…
ROI Maximization in Stochastic Online Decision-Making
Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour +1
We introduce a novel theoretical framework for Return On Investment (ROI) maximization in repeated decision-making. Our setting is motivated by the use case of companies that regul…
Cooperative Online Learning: Keeping your Neighbors Updated
Nicolò Cesa-Bianchi, Tommaso R. Cesari, Claire Monteleoni
We study an asynchronous online learning setting with a network of agents. At each time step, some of the agents are activated, requested to make a prediction, and pay the correspo…
Dynamic Pricing with Finitely Many Unknown Valuations
Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet
Motivated by posted price auctions where buyers are grouped in an unknown number of latent types characterized by their private values for the good on sale, we investigate revenue…