| 2025 | AISTATS | On Tradeoffs in Learning-Augmented Algorithms. | Ziyad Benomar, Vianney Perchet |
| 2025 | ICLR | Feature-Based Online Bilateral Trade. | Solenne Gaucher, Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Vianney Perchet |
| 2025 | ICML | Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search. | Ziyad Benomar, Lorenzo Croissant, Vianney Perchet, Spyros Angelopoulos |
| 2025 | ICML | The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback. | Cme Fiegel, Pierre Mnard, Tadashi Kozuno, Michal Valko, Vianney Perchet |
| 2025 | SODA | Prophet Inequalities: Competing with the Top | Mathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet |
| 2024 | AISTATS | Multi-armed bandits with guaranteed revenue per arm. | Dorian Baudry, Nadav Merlis, Mathieu Benjamin Molina, Hugo Richard, Vianney Perchet |
| 2024 | AISTATS | Constant or Logarithmic Regret in Asynchronous Multiplayer Bandits with Limited Communication. | Hugo Richard, Etienne Boursier, Vianney Perchet |
| 2024 | COLT | Mode Estimation with Partial Feedback. | Charles Arnal, Vivien Cabannes, Vianney Perchet |
| 2024 | ICASSP | Strategic Arms with Side Communication Prevail Over Low-Regret MAB Algorithms. | Ahmed Ben Yahmed, Clment Calauznes, Vianney Perchet |
| 2024 | ICML | Non-clairvoyant Scheduling with Partial Predictions. | Ziyad Benomar, Vianney Perchet |
| 2024 | ICML | Active Ranking and Matchmaking, with Perfect Matchings. | Hafedh El Ferchichi, Matthieu Lerasle, Vianney Perchet |
| 2024 | WISE | Open Research Challenges for Private Advertising Systems Under Local Differential Privacy. | Matilde Tullii, Solenne Gaucher, Hugo Richard, Eustache Diemert, Vianney Perchet, Alain Rakotomamonjy, Clment Calauznes, Maxime Vono |
| 2023 | AISTATS | Stochastic Mirror Descent for Large-Scale Sparse Recovery. | Sasila Ilandarideva, Yannis Bekri, Anatoli B. Juditsky, Vianney Perchet |
| 2023 | ICML | Adapting to game trees in zero-sum imperfect information games. | Cme Fiegel, Pierre Mnard, Tadashi Kozuno, Rmi Munos, Vianney Perchet, Michal Valko |
| 2023 | ICML | On Preemption and Learning in Stochastic Scheduling. | Nadav Merlis, Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet |
| 2022 | AISTATS | Encrypted Linear Contextual Bandit. | Evrard Garcelon, Matteo Pirotta, Vianney Perchet |
| 2022 | ALT | Social Learning in Non-Stationary Environments. | Etienne Boursier, Vianney Perchet, Marco Scarsini |
| 2022 | ALT | Privacy Amplification via Shuffling for Linear Contextual Bandits. | Evrard Garcelon, Kamalika Chaudhuri, Vianney Perchet, Matteo Pirotta |
| 2021 | ICML | Online A-Optimal Design and Active Linear Regression. | Xavier Fontaine, Pierre Perrault, Michal Valko, Vianney Perchet |
| 2021 | ICML | Pure Exploration and Regret Minimization in Matching Bandits. | Flore Sentenac, Jialin Yi, Clment Calauznes, Vianney Perchet, Milan Vojnovic |
| 2020 | AISTATS | Utility/Privacy Trade-off through the lens of Optimal Transport. | Etienne Boursier, Vianney Perchet |
| 2020 | AISTATS | A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players. | Abbas Mehrabian, Etienne Boursier, Emilie Kaufmann, Vianney Perchet |
| 2020 | AISTATS | Robust Stackelberg buyers in repeated auctions. | Thomas Nedelec, Clment Calauznes, Vianney Perchet, Noureddine El Karoui |
| 2020 | ALT | An adaptive stochastic optimization algorithm for resource allocation. | Xavier Fontaine, Shie Mannor, Vianney Perchet |
| 2020 | ALT | Finding Robust Nash equilibria. | Vianney Perchet |
| 2020 | COLT | Selfish Robustness and Equilibria in Multi-Player Bandits. | Etienne Boursier, Vianney Perchet |
| 2020 | COLT | Covariance-adapting algorithm for semi-bandits with application to sparse outcomes. | Pierre Perrault, Michal Valko, Vianney Perchet |
| 2020 | ICPR | Trajectory representation learning for Multi-Task NMRDP planning. | Firas Jarboui, Vianney Perchet |
| 2019 | AISTATS | Bridging the gap between regret minimization and best arm identification, with application to A/B tests. | Rmy Degenne, Thomas Nedelec, Clment Calauznes, Vianney Perchet |
| 2019 | AISTATS | Regularized Contextual Bandits. | Xavier Fontaine, Quentin Berthet, Vianney Perchet |
| 2019 | AISTATS | Finding the bandit in a graph: Sequential search-and-stop. | Pierre Perrault, Vianney Perchet, Michal Valko |
| 2019 | ALT | Dynamic Pricing with Finitely Many Unknown Valuations. | Nicol Cesa-Bianchi, Tommaso Cesari, Vianney Perchet |
| 2019 | ICML | Learning to bid in revenue-maximizing auctions. | Thomas Nedelec, Noureddine El Karoui, Vianney Perchet |
| 2019 | ICML | Exploiting structure of uncertainty for efficient matroid semi-bandits. | Pierre Perrault, Vianney Perchet, Michal Valko |
| 2019 | WWW | Learning to Bid in Revenue Maximizing Auction. | Thomas Nedelec, Noureddine El Karoui, Vianney Perchet |
| 2018 | UAI | Bandits with Side Observations: Bounded vs. Logarithmic Regret. | Rmy Degenne, Evrard Garcelon, Vianney Perchet |
| 2017 | AISTATS | Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates. | Joon Kwon, Vianney Perchet |
| 2017 | COLT | Sparse Stochastic Bandits. | Joon Kwon, Vianney Perchet, Claire Vernade |
| 2017 | UAI | Stochastic Bandit Models for Delayed Conversions. | Claire Vernade, Olivier Capp, Vianney Perchet |
| 2016 | COLT | Highly-Smooth Zero-th Order Online Optimization. | Francis R. Bach, Vianney Perchet |
| 2016 | COLT | Online Learning and Blackwell Approachability in Quitting Games. | Jnos Flesch, Rida Laraki, Vianney Perchet |
| 2016 | COLT | Online learning in repeated auctions. | Jonathan Weed, Vianney Perchet, Philippe Rigollet |
| 2016 | ICML | Anytime optimal algorithms in stochastic multi-armed bandits. | Rmy Degenne, Vianney Perchet |
| 2015 | COLT | Batched Bandit Problems. | Vianney Perchet, Philippe Rigollet, Sylvain Chassang, Erik Snowberg |
| 2014 | COLT | Approachability in unknown games: Online learning meets multi-objective optimization. | Shie Mannor, Vianney Perchet, Gilles Stoltz |
| 2014 | ICML | Gaussian Process Optimization with Mutual Information. | Emile Contal, Vianney Perchet, Nicolas Vayatis |
| 2013 | COLT | Bounded regret in stochastic multi-armed bandits. | Sbastien Bubeck, Vianney Perchet, Philippe Rigollet |
| 2013 | COLT | Approachability, fast and slow. | Vianney Perchet, Shie Mannor |
| 2009 | ALT | Calibration and Internal No-Regret with Random Signals. | Vianney Perchet |