activity
20102026
most citedBatched bandit problems

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

collaborators
Showing 2019Show all

10 papers · 1 filter

cs.GT2019★ 3 cited

Adversarial learning for revenue-maximizing auctions

Thomas Nedelec, Jules Baudet, Vianney Perchet +1

We introduce a new numerical framework to learn optimal bidding strategies in repeated auctions when the seller uses past bids to optimize her mechanism. Crucially, we do not assum…

cs.LG2019★ 9 cited

Markov Decision Process for MOOC users behavioral inference

Firas Jarboui, Célya Gruson-daniel, Pierre Chanial +6

Studies on massive open online courses (MOOCs) users discuss the existence of typical profiles and their impact on the learning process of the students. However defining the typica…

stat.ML2019★ 5 cited

Online A-Optimal Design and Active Linear Regression

Xavier Fontaine, Pierre Perrault, Michal Valko +1

We consider in this paper the problem of optimal experiment design where a decision maker can choose which points to sample to obtain an estimate of the hidden parameter $β…

cs.GT2019★ 1 cited

Robust Stackelberg buyers in repeated auctions

Clément Calauzènes, Thomas Nedelec, Vianney Perchet +1

We consider the practical and classical setting where the seller is using an exploration stage to learn the value distributions of the bidders before running a revenue-maximizing a…

cs.LG2019★ 3 cited

ROI Maximization in Stochastic Online Decision-Making

Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour +1

We introduce a novel theoretical framework for Return On Investment (ROI) maximization in repeated decision-making. Our setting is motivated by the use case of companies that regul…

stat.ML2019★ 2 cited

Utility/Privacy Trade-off through the lens of Optimal Transport

Etienne Boursier, Vianney Perchet

Strategic information is valuable either by remaining private (for instance if it is sensitive) or, on the other hand, by being used publicly to increase some utility. These two ob…