139 citations · 615 across the 107 of their papers we have counts for
8 papers · 1 filter
Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization
Marius Potfer, Vianney Perchet
Repeated multi-unit auctions, where a seller allocates multiple identical items over many rounds, are common mechanisms in electricity markets and treasury auctions. We compare the…
Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
Ahmed Ben Yahmed, Hafedh El Ferchichi, Marc Abeille +1
We examine a multi-armed bandit problem with contextual information, where the objective is to ensure that each arm receives a minimum aggregated reward across contexts while simul…
On the Hardness of Reinforcement Learning with Transition Look-Ahead
Corentin Pla, Hugo Richard, Marc Abeille +2
We study reinforcement learning (RL) with transition look-ahead, where the agent may observe which states would be visited upon playing any sequence of actions before decidi…
Online matching on stochastic block model
Maria Cherifa, Clément Calauzènes, Vianney Perchet
While online bipartite matching has gained significant attention in recent years, existing analyses in stochastic settings fail to capture the performance of algorithms on heteroge…
Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
Ziyad Benomar, Lorenzo Croissant, Vianney Perchet +1
One-max search is a classic problem in online decision-making, in which a trader acts on a sequence of revealed prices and accepts one of them irrevocably to maximise its profit. T…
Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet
We consider the classical multi-armed bandit problem, but with strategic arms. In this context, each arm is characterized by a bounded support reward distribution and strategically…