We study the problem of regret minimization for a single bidder in a seq...
In this work, we improve on the upper and lower bounds for the regret of...
We study repeated bilateral trade where an adaptive σ-smooth adversary
g...
We analyze the cumulative regret of the Dyadic Search algorithm of Bacho...
This paper studies a natural generalization of the problem of minimizing...
We study a repeated game between a supplier and a retailer who want to
m...
In this paper, we present a real-world application of online learning wi...
We investigate a nonstochastic bandit setting in which the loss of an ac...
Bilateral trade, a fundamental topic in economics, models the problem of...
Bilateral trade, a fundamental topic in economics, models the problem of...
We study the problem of black-box optimization of a Lipschitz function f...
We study the problem of approximating the level set of an unknown functi...
We consider the problem of asynchronous online combinatorial optimizatio...
The property of almost every point being a Lebesgue point has proven to ...
We consider the problem of maximizing a non-concave Lipschitz multivaria...
Motivated by posted price auctions where buyers are grouped in an unknow...