2 citations · 2 across the 10 of their papers we have counts for
11 papers
Online Convex Optimization with Sublinear Noisy Probes
Simone Di Gregorio, Anupam Gupta, Stefano Leonardi +1
We study Online Convex Optimization (OCO) over a convex set , where in each round the learner selects and then observes a convex loss $f_t:K\…
Private Learning in Bilateral Trade
Simone Di Gregorio, Federico Fusco, Stefano Leonardi +1
Bilateral trade models one of the most fundamental economic interactions: the intermediation between two strategic agents, a seller and a buyer, willing to trade a good. We conside…
Contextual Online Bilateral Trade
Romain Cosson, Federico Fusco, Anupam Gupta +3
We study repeated bilateral trade when the valuations of the sellers and the buyers are contextual. More precisely, the agents' valuations are given by the inner product of a conte…
Anonymous Contracts
Johannes Brustle, Paul Duetting, Stefano Leonardi +2
We study a multi-agent contracting problem where agents exert costly effort to achieve individually observable binary outcomes. While the principal can theoretically extract the fu…
Multicalibration Yields Better Matchings
Riccardo Colini Baldeschi, Simone Di Gregorio, Simone Fioravanti +9
Consider the problem of finding the best matching in a weighted graph where we only have access to predictions of the actual stochastic weights, based on an underlying context. If…
Online Learning in the Random Order Model
Martino Bernasconi, Andrea Celli, Riccardo Colini-Baldeschi +3
In the random-order model for online learning, the sequence of losses is chosen upfront by an adversary and presented to the learner after a random permutation. Any random-order in…
Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets
Riccardo Colini-Baldeschi, Sophie Klumper, Twan Kroll +3
Online advertising systems have recently transitioned to autobidding, allowing advertisers to delegate bidding decisions to automated agents. Each advertiser directs their agent to…
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…
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
Tomer Ezra, Stefano Leonardi, Michał Pawłowski +2
The online joint replenishment problem (JRP) is a fundamental problem in the area of online problems with delay. Over the last decade, several works have studied generalizations of…
Contract Design Beyond Hidden-Actions
Tomer Ezra, Stefano Leonardi, Matteo Russo
In the classical principal-agent hidden-action contract model, a principal delegates the execution of a costly task to an agent. In order to complete the task, the agent chooses an…
Online Revenue Maximization for Server Pricing
Shant Boodaghians, Federico Fusco, Stefano Leonardi +2
Efficient and truthful mechanisms to price resources on remote servers/machines has been the subject of much work in recent years due to the importance of the cloud market. This pa…