activity
20102026
most citedBatched bandit problems

139 citations · 615 across the 107 of their papers we have counts for

collaborators
Showing cs.GTShow all

24 papers · 1 filter

cs.GT2026

Kernel Methods for Refined Prophet Inequalities

Patrick Loiseau, Mathieu Molina, Vianney Perchet +2

The single-selection prophet inequality is a canonical Bayesian online selection problem in which independent nonnegative values arrive sequentially and the decision-maker must irr…

cs.GT2026

I.i.d. Prophet Inequalities with Discounted Rewards: As Hard as the Non-i.i.d. Case

Jung-hun Kim, Vianney Perchet

We study prophet inequalities with discounted rewards, where i.i.d. base rewards are multiplicatively discounted over time. Our main message is that even this structured and arbitr…

cs.GT2026

Prophet Inequalities under Local Differential Privacy

Achraf Azize, Mathieu Molina, Hugo Richard +1

Many online decision platforms, from hiring marketplaces to auctions, face a tension between efficient decision-making and the protection of participants' privacy. Personal informa…

cs.GT2025

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…

cs.GT2025

Improved learning rates in multi-unit uniform price auctions

Marius Potfer, Dorian Baudry, Hugo Richard +2

Motivated by the strategic participation of electricity producers in electricity day-ahead market, we study the problem of online learning in repeated multi-unit uniform price auct…

cs.GT2024

Stable Matching with Ties: Approximation Ratios and Learning

Shiyun Lin, Simon Mauras, Nadav Merlis +1

We study matching markets with ties, where workers on one side of the market may have tied preferences over jobs, determined by their matching utilities. Unlike classical two-sided…