20 citations · 63 across the 29 of their papers we have counts for
35 papers
Single-dimensional Contract Design: Efficient Algorithms and Learning
Martino Bernasconi, Matteo Castiglioni, Andrea Celli
We study a Bayesian contract design problem in which a principal interacts with an unknown agent. We consider the single-parameter uncertainty model introduced by Alon et al. [2021…
Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
Maria-Florina Balcan, Martino Bernasconi, Matteo Castiglioni +3
We study the problem of online learning in Stackelberg games with side information between a leader and a sequence of followers. In every round the leader observes contextual infor…
Improved Hardness Results for Min-Max Optimization with Coupled Constraints
Martino Bernasconi, Matteo Castiglioni, Andrea Celli +1
We investigate the computational complexity of min-max optimization under coupled constraints. The work of Daskalakis, Skoulakis, and Zampetakis [DSZ21] was the first to study min-…
Online Learning with Sublinear Best-Action Queries
Matteo Russo, Andrea Celli, Riccardo Colini Baldeschi +5
In online learning, a decision maker repeatedly selects one of a set of actions, with the goal of minimizing the overall loss incurred. Following the recent line of research on alg…
Feature-Based Online Bilateral Trade
Solenne Gaucher, Martino Bernasconi, Matteo Castiglioni +2
Bilateral trade models the problem of facilitating trades between a seller and a buyer having private valuations for the item being sold. In the online version of the problem, the…
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
Martino Bernasconi, Matteo Castiglioni, Andrea Celli +1
We address a generalization of the bandit with knapsacks problem, where a learner aims to maximize rewards while satisfying an arbitrary set of long-term constraints. Our goal is t…