6 citations · 10 across the 2 of their papers we have counts for
9 papers
Decentralized Learning in Online Queuing Systems
Flore Sentenac, Etienne Boursier, Vianney Perchet
Motivated by packet routing in computer networks, online queuing systems are composed of queues receiving packets at different rates. Repeatedly, they send packets to servers, each…
Making the most of your day: online learning for optimal allocation of time
Etienne Boursier, Tristan Garrec, Vianney Perchet +1
We study online learning for optimal allocation when the resource to be allocated is time. %Examples of possible applications include job scheduling for a computing server, a drive…
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits
Pierre Perrault, Etienne Boursier, Vianney Perchet +1
We investigate stochastic combinatorial multi-armed bandit with semi-bandit feedback (CMAB). In CMAB, the question of the existence of an efficient policy with an optimal asymptoti…
Selfish Robustness and Equilibria in Multi-Player Bandits
Etienne Boursier, Vianney Perchet
Motivated by cognitive radios, stochastic multi-player multi-armed bandits gained a lot of interest recently. In this class of problems, several players simultaneously pull arms an…
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…
A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players
Etienne Boursier, Emilie Kaufmann, Abbas Mehrabian +1
We study a multiplayer stochastic multi-armed bandit problem in which players cannot communicate, and if two or more players pull the same arm, a collision occurs and the involved…