Vianney Perchet

187 papers A* 52A 15B 7Misc 1Journal 106Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Learning to Allocate Resources with Censored Feedback. CoRR Giovanni Montanari, Côme Fiegel, Corentin Pla, Aadirupa Saha, Vianney Perchet
2025	J	`jnl`	Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization. CoRR Marius Potfer, Vianney Perchet
2025	A*	`conf`	Feature-Based Online Bilateral Trade. ICLR Solenne Gaucher, Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Vianney Perchet
2025	J	`jnl`	Improved learning rates in multi-unit uniform price auctions. CoRR Marius Potfer, Dorian Baudry, Hugo Richard, Vianney Perchet, Cheng Wan
2025	J	`jnl`	Multi-Armed Bandits with Minimum Aggregated Revenue Constraints. CoRR Ahmed Ben Yahmed, Hafedh El Ferchichi, Marc Abeille, Vianney Perchet
2025	A	`conf`	On Tradeoffs in Learning-Augmented Algorithms. AISTATS Ziyad Benomar, Vianney Perchet
2025	J	`jnl`	On Tradeoffs in Learning-Augmented Algorithms. CoRR Ziyad Benomar, Vianney Perchet
2025	J	`jnl`	On the hardness of RL with Lookahead. CoRR Corentin Pla, Hugo Richard, Marc Abeille, Nadav Merlis, Vianney Perchet
2025	J	`jnl`	Online matching on stochastic block model. CoRR Maria Cherifa, Clément Calauzènes, Vianney Perchet
2025	A*	`conf`	Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search. ICML Ziyad Benomar, Lorenzo Croissant, Vianney Perchet, Spyros Angelopoulos
2025	J	`jnl`	Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search. CoRR Ziyad Benomar, Lorenzo Croissant, Vianney Perchet, Spyros Angelopoulos
2025	A*	`conf`	Prophet Inequalities: Competing with the Top SODA Mathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet
2025	J	`jnl`	Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting. CoRR Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet
2025	A*	`conf`	The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback. ICML Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Michal Valko, Vianney Perchet
2024	J	`jnl`	A Survey on Multi-player Bandits. J. Mach. Learn. Res. Etienne Boursier, Vianney Perchet
2024	A*	`conf`	Active Ranking and Matchmaking, with Perfect Matchings. ICML Hafedh El Ferchichi, Matthieu Lerasle, Vianney Perchet
2024	A*	`conf`	Addressing Bias in Online Selection with Limited Budget of Comparisons. NeurIPS Ziyad Benomar, Evgenii Chzhen, Nicolas Schreuder, Vianney Perchet
2024	J	`jnl`	An Algorithmic Solution to the Blotto Game Using Multimarginal Couplings. Oper. Res. Vianney Perchet, Philippe Rigollet, Thibaut Le Gouic
2024	A*	`conf`	Calibrated Forecasting and Persuasion. EC Atulya Jain, Vianney Perchet
2024	J	`jnl`	Calibrated Forecasting and Persuasion. CoRR Atulya Jain, Vianney Perchet
2024	A	`conf`	Constant or Logarithmic Regret in Asynchronous Multiplayer Bandits with Limited Communication. AISTATS Hugo Richard, Etienne Boursier, Vianney Perchet
2024	A*	`conf`	DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation. NeurIPS Felipe Garrido-Lucero, Benjamin Heymann, Maxime Vono, Patrick Loiseau, Vianney Perchet
2024	J	`jnl`	Dynamic online matching with budget refills. CoRR Maria Cherifa, Clément Calauzènes, Vianney Perchet
2024	J	`jnl`	Feature-Based Online Bilateral Trade. CoRR Solenne Gaucher, Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Vianney Perchet
2024	A*	`conf`	Improved Algorithms for Contextual Dynamic Pricing. NeurIPS Matilde Tullii, Solenne Gaucher, Nadav Merlis, Vianney Perchet
2024	J	`jnl`	Improved Algorithms for Contextual Dynamic Pricing. CoRR Matilde Tullii, Solenne Gaucher, Nadav Merlis, Vianney Perchet
2024	A*	`conf`	Improved learning rates in multi-unit uniform price auctions. NeurIPS Marius Potfer, Dorian Baudry, Hugo Richard, Vianney Perchet, Cheng Wan
2024	A*	`conf`	Local and Adaptive Mirror Descents in Extensive-Form Games. NeurIPS Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko
2024	A*	`conf`	Lookback Prophet Inequalities. NeurIPS Ziyad Benomar, Dorian Baudry, Vianney Perchet
2024	J	`jnl`	Lookback Prophet Inequalities. CoRR Ziyad Benomar, Dorian Baudry, Vianney Perchet
2024	A*	`conf`	Mode Estimation with Partial Feedback. COLT Charles Arnal, Vivien Cabannes, Vianney Perchet
2024	J	`jnl`	Mode Estimation with Partial Feedback. CoRR Charles Arnal, Vivien Cabannes, Vianney Perchet
2024	A	`conf`	Multi-armed bandits with guaranteed revenue per arm. AISTATS Dorian Baudry, Nadav Merlis, Mathieu Benjamin Molina, Hugo Richard, Vianney Perchet
2024	A*	`conf`	Non-clairvoyant Scheduling with Partial Predictions. ICML Ziyad Benomar, Vianney Perchet
2024	J	`jnl`	Non-clairvoyant Scheduling with Partial Predictions. CoRR Ziyad Benomar, Vianney Perchet
2024	—	`conf`	Open Research Challenges for Private Advertising Systems Under Local Differential Privacy. WISE (5) Matilde Tullii, Solenne Gaucher, Hugo Richard, Eustache Diemert, Vianney Perchet, Alain Rakotomamonjy, Clément Calauzènes, Maxime Vono
2024	A*	`conf`	Optimizing the coalition gain in Online Auctions with Greedy Structured Bandits. NeurIPS Dorian Baudry, Hugo Richard, Maria Cherifa, Vianney Perchet, Clément Calauzènes
2024	J	`jnl`	Prophet Inequalities: Competing with the Top ℓ Items is Easy. CoRR Mathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet
2024	J	`jnl`	Stable Matching with Ties: Approximation Ratios and Learning. CoRR Shiyun Lin, Simon Mauras, Nadav Merlis, Vianney Perchet
2024	Misc	`conf`	Strategic Arms with Side Communication Prevail Over Low-Regret MAB Algorithms. ICASSP Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet
2024	J	`jnl`	Strategic Arms with Side Communication Prevail Over Low-Regret MAB Algorithms. CoRR Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet
2024	A*	`conf`	Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting. NeurIPS Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet
2024	J	`jnl`	The Price of Fairness in Bipartite Matching. CoRR Rémi Castera, Felipe Garrido-Lucero, Mathieu Molina, Simon Mauras, Patrick Loiseau, Vianney Perchet
2024	A*	`conf`	The Value of Reward Lookahead in Reinforcement Learning. NeurIPS Nadav Merlis, Dorian Baudry, Vianney Perchet
2024	J	`jnl`	The Value of Reward Lookahead in Reinforcement Learning. CoRR Nadav Merlis, Dorian Baudry, Vianney Perchet
2024	J	`jnl`	Utility/privacy trade-off as regularized optimal transport. Math. Program. Etienne Boursier, Vianney Perchet
2023	A*	`conf`	Adapting to game trees in zero-sum imperfect information games. ICML Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko
2023	J	`jnl`	Addressing bias in online selection with limited budget of comparisons. CoRR Ziyad Benomar, Evgenii Chzhen, Nicolas Schreuder, Vianney Perchet
2023	A*	`conf`	Advice Querying under Budget Constraint for Online Algorithms. NeurIPS Ziyad Benomar, Vianney Perchet
2023	J	`jnl`	Constant or logarithmic regret in asynchronous multiplayer bandits. CoRR Hugo Richard, Etienne Boursier, Vianney Perchet
2023	J	`jnl`	DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation. CoRR Felipe Garrido-Lucero, Benjamin Heymann, Maxime Vono, Patrick Loiseau, Vianney Perchet
2023	J	`jnl`	Local and adaptive mirror descents in extensive-form games. CoRR Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko
2023	A*	`conf`	On Preemption and Learning in Stochastic Scheduling. ICML Nadav Merlis, Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet
2023	J	`jnl`	Online Matching in Geometric Random Graphs. CoRR Flore Sentenac, Nathan Noiry, Matthieu Lerasle, Laurent Ménard, Vianney Perchet
2023	A	`conf`	Stochastic Mirror Descent for Large-Scale Sparse Recovery. AISTATS Sasila Ilandarideva, Yannis Bekri, Anatoli B. Juditsky, Vianney Perchet
2023	A*	`conf`	Trading-off price for data quality to achieve fair online allocation. NeurIPS Mathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet
2023	J	`jnl`	Trading-off price for data quality to achieve fair online allocation. CoRR Mathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet
2022	J	`jnl`	A survey on multi-player bandits. CoRR Etienne Boursier, Vianney Perchet
2022	A*	`conf`	Active Labeling: Streaming Stochastic Gradients. NeurIPS Vivien Cabannes, Francis R. Bach, Vianney Perchet, Alessandro Rudi
2022	J	`jnl`	Active Labeling: Streaming Stochastic Gradients. CoRR Vivien Cabannes, Francis R. Bach, Vianney Perchet, Alessandro Rudi
2022	J	`jnl`	Adapting to game trees in zero-sum imperfect information games. CoRR Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko
2022	A*	`conf`	An Algorithmic Solution to the Blotto Game using Multi-marginal Couplings. EC Vianney Perchet, Philippe Rigollet, Thibaut Le Gouic
2022	J	`jnl`	An algorithmic solution to the Blotto game using multi-marginal couplings. CoRR Vianney Perchet, Philippe Rigollet, Thibaut Le Gouic
2022	A	`conf`	Encrypted Linear Contextual Bandit. AISTATS Evrard Garcelon, Matteo Pirotta, Vianney Perchet
2022	J	`jnl`	Learning in Repeated Auctions. Found. Trends Mach. Learn. Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet
2022	B	`conf`	Privacy Amplification via Shuffling for Linear Contextual Bandits. ALT Evrard Garcelon, Kamalika Chaudhuri, Vianney Perchet, Matteo Pirotta
2022	J	`jnl`	Revenue-Maximizing Auctions: A Bidder's Standpoint. Oper. Res. Thomas Nedelec, Clément Calauzènes, Vianney Perchet, Noureddine El Karoui
2022	B	`conf`	Social Learning in Non-Stationary Environments. ALT Etienne Boursier, Vianney Perchet, Marco Scarsini
2022	J	`jnl`	Static Scheduling with Predictions Learned through Efficient Exploration. CoRR Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet
2022	J	`jnl`	Stochastic Mirror Descent for Large-Scale Sparse Recovery. CoRR Sasila Ilandarideva, Yannis Bekri, Anatoli B. Juditsky, Vianney Perchet
2021	J	`jnl`	A Generalised Inverse Reinforcement Learning Framework. CoRR Firas Jarboui, Vianney Perchet
2021	A*	`conf`	A New Theoretical Framework for Fast and Accurate Online Decision-Making. NeurIPS Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour, Vianney Perchet
2021	A	`conf`	Adversarial Learning in Revenue-Maximizing Auctions. AAMAS Thomas Nedelec, Jules Baudet, Vianney Perchet, Noureddine El Karoui
2021	J	`jnl`	Be Greedy in Multi-Armed Bandits. CoRR Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
2021	A*	`conf`	Decentralized Learning in Online Queuing Systems. NeurIPS Flore Sentenac, Etienne Boursier, Vianney Perchet
2021	J	`jnl`	Decentralized Learning in Online Queuing Systems. CoRR Flore Sentenac, Etienne Boursier, Vianney Perchet
2021	J	`jnl`	Homomorphically Encrypted Linear Contextual Bandit. CoRR Evrard Garcelon, Vianney Perchet, Matteo Pirotta
2021	A*	`conf`	Local Differential Privacy for Regret Minimization in Reinforcement Learning. NeurIPS Evrard Garcelon, Vianney Perchet, Ciara Pike-Burke, Matteo Pirotta
2021	A*	`conf`	Making the most of your day: online learning for optimal allocation of time. NeurIPS Etienne Boursier, Tristan Garrec, Vianney Perchet, Marco Scarsini
2021	J	`jnl`	Making the most of your day: online learning for optimal allocation of time. CoRR Etienne Boursier, Tristan Garrec, Vianney Perchet, Marco Scarsini
2021	J	`jnl`	Offline Inverse Reinforcement Learning. CoRR Firas Jarboui, Vianney Perchet
2021	A*	`conf`	Online A-Optimal Design and Active Linear Regression. ICML Xavier Fontaine, Pierre Perrault, Michal Valko, Vianney Perchet
2021	A*	`conf`	Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm. NeurIPS Nathan Noiry, Vianney Perchet, Flore Sentenac
2021	J	`jnl`	Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm. CoRR Nathan Noiry, Flore Sentenac, Vianney Perchet
2021	A*	`conf`	Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits. NeurIPS Reda Ouhamma, Odalric-Ambrym Maillard, Vianney Perchet
2021	J	`jnl`	Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits. CoRR Reda Ouhamma, Rémy Degenne, Pierre Gaillard, Vianney Perchet
2021	J	`jnl`	Privacy Amplification via Shuffling for Linear Contextual Bandits. CoRR Evrard Garcelon, Kamalika Chaudhuri, Vianney Perchet, Matteo Pirotta
2021	A*	`conf`	Pure Exploration and Regret Minimization in Matching Bandits. ICML Flore Sentenac, Jialin Yi, Clément Calauzènes, Vianney Perchet, Milan Vojnovic
2021	J	`jnl`	Pure Exploration and Regret Minimization in Matching Bandits. CoRR Flore Sentenac, Jialin Yi, Clément Calauzènes, Vianney Perchet, Milan Vojnovic
2021	J	`jnl`	Quickest change detection with unknown parameters: Constant complexity and near optimality. CoRR Firas Jarboui, Vianney Perchet
2021	A*	`conf`	Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge. NeurIPS Reda Ouhamma, Odalric-Ambrym Maillard, Vianney Perchet
2021	J	`jnl`	Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge. CoRR Reda Ouhamma, Odalric Maillard, Vianney Perchet
2021	J	`jnl`	Unsupervised Neural Hidden Markov Models with a Continuous latent state space. CoRR Firas Jarboui, Vianney Perchet
2020	A	`conf`	A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players. AISTATS Abbas Mehrabian, Etienne Boursier, Emilie Kaufmann, Vianney Perchet
2020	B	`conf`	An adaptive stochastic optimization algorithm for resource allocation. ALT Xavier Fontaine, Shie Mannor, Vianney Perchet
2020	—	`conf`	Categorized Bandits. CIRCLE Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
2020	J	`jnl`	Categorized Bandits. CoRR Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
2020	A*	`conf`	Covariance-adapting algorithm for semi-bandits with application to sparse outcomes. COLT Pierre Perrault, Michal Valko, Vianney Perchet
2020	B	`conf`	Finding Robust Nash equilibria. ALT Vianney Perchet
2020	J	`jnl`	Learning in repeated auctions. CoRR Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet
2020	J	`jnl`	Lifelong Learning in Multi-Armed Bandits. CoRR Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
2020	J	`jnl`	Local Differentially Private Regret Minimization in Reinforcement Learning. CoRR Evrard Garcelon, Vianney Perchet, Ciara Pike-Burke, Matteo Pirotta
2020	A	`conf`	Robust Stackelberg buyers in repeated auctions. AISTATS Thomas Nedelec, Clément Calauzènes, Vianney Perchet, Noureddine El Karoui
2020	A*	`conf`	Robustness of Community Detection to Random Geometric Perturbations. NeurIPS Sandrine Péché, Vianney Perchet
2020	J	`jnl`	Robustness of Community Detection to Random Geometric Perturbations. CoRR Sandrine Péché, Vianney Perchet
2020	A*	`conf`	Selfish Robustness and Equilibria in Multi-Player Bandits. COLT Etienne Boursier, Vianney Perchet
2020	J	`jnl`	Selfish Robustness and Equilibria in Multi-Player Bandits. CoRR Etienne Boursier, Vianney Perchet
2020	J	`jnl`	Speed of Social Learning from Reviews in Non-Stationary Environments. CoRR Etienne Boursier, Vianney Perchet, Marco Scarsini
2020	A*	`conf`	Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits. NeurIPS Pierre Perrault, Etienne Boursier, Michal Valko, Vianney Perchet
2020	J	`jnl`	Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits. CoRR Pierre Perrault, Etienne Boursier, Vianney Perchet, Michal Valko
2020	B	`conf`	Trajectory representation learning for Multi-Task NMRDP planning. ICPR Firas Jarboui, Vianney Perchet
2020	A	`conf`	Utility/Privacy Trade-off through the lens of Optimal Transport. AISTATS Etienne Boursier, Vianney Perchet
2019	J	`jnl`	A Problem-Adaptive Algorithm for Resource Allocation. CoRR Xavier Fontaine, Shie Mannor, Vianney Perchet
2019	J	`jnl`	Active Linear Regression. CoRR Xavier Fontaine, Pierre Perrault, Vianney Perchet
2019	J	`jnl`	Adversarial learning for revenue-maximizing auctions. CoRR Thomas Nedelec, Jules Baudet, Vianney Perchet, Noureddine El Karoui
2019	A	`conf`	Bridging the gap between regret minimization and best arm identification, with application to A/B tests. AISTATS Rémy Degenne, Thomas Nedelec, Clément Calauzènes, Vianney Perchet
2019	A*	`conf`	Categorized Bandits. NeurIPS Matthieu Jedor, Vianney Perchet, Jonathan Louëdec
2019	B	`conf`	Dynamic Pricing with Finitely Many Unknown Valuations. ALT Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet
2019	J	`jnl`	Exploiting Structure of Uncertainty for Efficient Combinatorial Semi-Bandits. CoRR Pierre Perrault, Vianney Perchet, Michal Valko
2019	A*	`conf`	Exploiting structure of uncertainty for efficient matroid semi-bandits. ICML Pierre Perrault, Vianney Perchet, Michal Valko
2019	A	`conf`	Finding the bandit in a graph: Sequential search-and-stop. AISTATS Pierre Perrault, Vianney Perchet, Michal Valko
2019	—	`conf`	Learning to Bid in Revenue Maximizing Auction. WWW (Companion Volume) Thomas Nedelec, Noureddine El Karoui, Vianney Perchet
2019	A*	`conf`	Learning to bid in revenue-maximizing auctions. ICML Thomas Nedelec, Noureddine El Karoui, Vianney Perchet
2019	J	`jnl`	Learning to bid in revenue-maximizing auctions. CoRR Thomas Nedelec, Noureddine El Karoui, Vianney Perchet
2019	—	`conf`	Markov Decision Process for MOOC Users Behavioral Inference. EMOOCs Firas Jarboui, Célya Gruson-Daniel, Alain Durmus, Vincent Rocchisani, Sophie-Helene Goulet Ebongue, Anneliese Depoux, Wilfried Kirschenmann, Vianney Perchet
2019	J	`jnl`	Markov Decision Process for MOOC users behavioral inference. CoRR Firas Jarboui, Célya Gruson-Daniel, Alain Durmus, Vincent Rocchisani, Sophie-Helene Goulet Ebongue, Anneliese Depoux, Wilfried Kirschenmann, Vianney Perchet
2019	J	`jnl`	Private Learning and Regularized Optimal Transport. CoRR Etienne Boursier, Vianney Perchet
2019	A	`conf`	Regularized Contextual Bandits. AISTATS Xavier Fontaine, Quentin Berthet, Vianney Perchet
2019	J	`jnl`	Repeated A/B Testing. CoRR Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour, Vianney Perchet
2019	J	`jnl`	Robust Stackelberg buyers in repeated auctions. CoRR Clément Calauzènes, Thomas Nedelec, Vianney Perchet, Noureddine El Karoui
2019	A*	`conf`	SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits. NeurIPS Etienne Boursier, Vianney Perchet
2018	J	`jnl`	A differential game on Wasserstein space. Application to weak approachability with partial monitoring. CoRR Vianney Perchet, Marc Quincampoix
2018	J	`jnl`	Approachability of convex sets in generalized quitting games. Games Econ. Behav. János Flesch, Rida Laraki, Vianney Perchet
2018	A	`conf`	Bandits with Side Observations: Bounded vs. Logarithmic Regret. UAI Rémy Degenne, Evrard Garcelon, Vianney Perchet
2018	J	`jnl`	Bandits with Side Observations: Bounded vs. Logarithmic Regret. CoRR Rémy Degenne, Evrard Garcelon, Vianney Perchet
2018	J	`jnl`	Bridging the gap between regret minimization and best arm identification, with application to A/B tests. CoRR Rémy Degenne, Thomas Nedelec, Clément Calauzènes, Vianney Perchet
2018	A*	`ed.`	Conference On Learning Theory, COLT 2018, Stockholm, Sweden, 6-9 July 2018. COLT Sébastien Bubeck, Vianney Perchet, Philippe Rigollet
2018	J	`jnl`	Dynamic Pricing with Finitely Many Unknown Valuations. CoRR Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet
2018	J	`jnl`	Explicit shading strategies for repeated truthful auctions. CoRR Marc Abeille, Clément Calauzènes, Noureddine El Karoui, Thomas Nedelec, Vianney Perchet
2018	J	`jnl`	Finding the Bandit in a Graph: Sequential Search-and-Stop. CoRR Pierre Perrault, Vianney Perchet, Michal Valko
2018	J	`jnl`	Regularized Contextual Bandits. CoRR Xavier Fontaine, Quentin Berthet, Vianney Perchet
2018	J	`jnl`	SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits. CoRR Etienne Boursier, Vianney Perchet
2018	J	`jnl`	Thresholding the virtual value: a simple method to increase welfare and lower reserve prices in online auction systems. CoRR Thomas Nedelec, Marc Abeille, Clément Calauzènes, Noureddine El Karoui, Benjamin Heymann, Vianney Perchet
2017	J	`jnl`	A comparative study of counterfactual estimators. CoRR Thomas Nedelec, Nicolas Le Roux, Vianney Perchet
2017	J	`jnl`	Bandit Optimization with Upper-Confidence Frank-Wolfe. CoRR Quentin Berthet, Vianney Perchet
2017	—	`conf`	Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe. NIPS Quentin Berthet, Vianney Perchet
2017	A	`conf`	Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates. AISTATS Joon Kwon, Vianney Perchet
2017	A*	`conf`	Sparse Stochastic Bandits. COLT Joon Kwon, Vianney Perchet, Claire Vernade
2017	J	`jnl`	Sparse Stochastic Bandits. CoRR Joon Kwon, Vianney Perchet, Claire Vernade
2017	A	`conf`	Stochastic Bandit Models for Delayed Conversions. UAI Claire Vernade, Olivier Cappé, Vianney Perchet
2017	J	`jnl`	Stochastic Bandit Models for Delayed Conversions. CoRR Claire Vernade, Olivier Cappé, Vianney Perchet
2016	A*	`conf`	Anytime optimal algorithms in stochastic multi-armed bandits. ICML Rémy Degenne, Vianney Perchet
2016	J	`jnl`	Approachability of convex sets in generalized quitting games. CoRR János Flesch, Rida Laraki, Vianney Perchet
2016	—	`conf`	Combinatorial semi-bandit with known covariance. NIPS Rémy Degenne, Vianney Perchet
2016	J	`jnl`	Combinatorial semi-bandit with known covariance. CoRR Rémy Degenne, Vianney Perchet
2016	J	`jnl`	Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case. J. Mach. Learn. Res. Joon Kwon, Vianney Perchet
2016	J	`jnl`	Highly-Smooth Zero-th Order Online Optimization Vianney Perchet. CoRR Francis R. Bach, Vianney Perchet
2016	A*	`conf`	Highly-Smooth Zero-th Order Online Optimization. COLT Francis R. Bach, Vianney Perchet
2016	A*	`conf`	Online Learning and Blackwell Approachability in Quitting Games. COLT János Flesch, Rida Laraki, Vianney Perchet
2016	A*	`conf`	Online learning in repeated auctions. COLT Jonathan Weed, Vianney Perchet, Philippe Rigollet
2016	J	`jnl`	Quantitative Analysis of Dynamic Fault Trees Based on the Coupling of Structure Functions and Monte Carlo Simulation. Qual. Reliab. Eng. Int. Guillaume Merle, Jean-Marc Roussel, Jean-Jacques Lesage, Vianney Perchet, Nicolas Vayatis
2015	A*	`conf`	Batched Bandit Problems. COLT Vianney Perchet, Philippe Rigollet, Sylvain Chassang, Erik Snowberg
2015	J	`jnl`	Exponential Weight Approachability, Applications to Calibration and Regret Minimization. Dyn. Games Appl. Vianney Perchet
2015	J	`jnl`	Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case. CoRR Joon Kwon, Vianney Perchet
2015	J	`jnl`	On a Unified Framework for Approachability with Full or Partial Monitoring. Math. Oper. Res. Vianney Perchet, Marc Quincampoix
2015	J	`jnl`	Online learning in repeated auctions. CoRR Jonathan Weed, Vianney Perchet, Philippe Rigollet
2014	J	`jnl`	A note on robust Nash equilibria with uncertainties. RAIRO Oper. Res. Vianney Perchet
2014	A*	`conf`	Approachability in unknown games: Online learning meets multi-objective optimization. COLT Shie Mannor, Vianney Perchet, Gilles Stoltz
2014	J	`jnl`	Approachability in unknown games: Online learning meets multi-objective optimization. CoRR Shie Mannor, Vianney Perchet, Gilles Stoltz
2014	A*	`conf`	Gaussian Process Optimization with Mutual Information. ICML Emile Contal, Vianney Perchet, Nicolas Vayatis
2014	J	`jnl`	Set-valued approachability and online learning with partial monitoring. J. Mach. Learn. Res. Shie Mannor, Vianney Perchet, Gilles Stoltz
2013	J	`jnl`	A Primal Condition for Approachability with Partial Monitoring CoRR Shie Mannor, Vianney Perchet, Gilles Stoltz
2013	J	`jnl`	Approachability, Regret and Calibration; implications and equivalences CoRR Vianney Perchet
2013	A*	`conf`	Approachability, fast and slow. COLT Vianney Perchet, Shie Mannor
2013	J	`jnl`	Bounded regret in stochastic multi-armed bandits CoRR Sébastien Bubeck, Vianney Perchet, Philippe Rigollet
2013	A*	`conf`	Bounded regret in stochastic multi-armed bandits. COLT Sébastien Bubeck, Vianney Perchet, Philippe Rigollet
2013	J	`jnl`	Nash equilibria with partial monitoring; Computation and Lemke-Howson algorithm CoRR Vianney Perchet
2013	J	`jnl`	On an unified framework for approachability in games with or without signals CoRR Vianney Perchet, Marc Quincampoix
2011	J	`jnl`	Approachability of Convex Sets in Games with Partial Monitoring CoRR Vianney Perchet
2011	J	`jnl`	Approachability of Convex Sets in Games with Partial Monitoring. J. Optim. Theory Appl. Vianney Perchet
2011	J	`jnl`	Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms CoRR Vianney Perchet
2011	J	`jnl`	Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms. J. Mach. Learn. Res. Vianney Perchet
2011	J	`jnl`	Robust approachability and regret minimization in games with partial monitoring CoRR Shie Mannor, Vianney Perchet, Gilles Stoltz
2011	A*	`conf`	Robust approachability and regret minimization in games with partial monitoring. COLT Shie Mannor, Vianney Perchet, Gilles Stoltz
2011	J	`jnl`	The multi-armed bandit problem with covariates CoRR Vianney Perchet, Philippe Rigollet
2010	J	`jnl`	Calibration and Internal no-Regret with Partial Monitoring CoRR Vianney Perchet
2009	B	`conf`	Calibration and Internal No-Regret with Random Signals. ALT Vianney Perchet