|
|
Corrigendum to "Robust approachability and regret minimization in games with partial monitoring
Shie Mannor
,
Vianney Perchet
,
Gilles Stoltz
2011
Preprints, Working Papers, ...
hal-00617554v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Thresholding at the monopoly price: an agnostic way to improve bidding strategies in revenue-maximizing auctions
Thomas Nedelec
,
Marc Abeille
,
Clément Calauzènes
,
Benjamin Heymann
,
Vianney Perchet
et al.
2020
Preprints, Working Papers, ...
hal-03089546v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Online learning in repeated auctions
Vianney Perchet
,
Philippe Rigollet
,
John Weed
2015
Preprints, Working Papers, ...
hal-01265076v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits
Reda Ouhamma
,
Rémy Degenne
,
Pierre Gaillard
,
Vianney Perchet
NeurIPS 2021 - 35th International Conference on Neural Information Processing Systems, Dec 2021, Virtual, Canada. pp.1-25
Conference papers
hal-03363014v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On an unified framework for approachability in games with or without signals
Vianney Perchet
,
Marc Quincampoix
2013
Preprints, Working Papers, ...
hal-00776676v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
A Primal Condition for Approachability with Partial Monitoring
Shie Mannor
,
Vianney Perchet
,
Gilles Stoltz
Journal of Dynamics and Games, 2013, pp.2-27
Journal articles
hal-00772056v2
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
A differential game on Wasserstein space. Application to weak approachability with partial monitoring
Vianney Perchet
,
Marc Quincampoix
Journal of Dynamics and Games, 2019
Journal articles
hal-03089560v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Robust Stackelberg buyers in repeated auctions
Clément Calauzènes
,
Thomas Nedelec
,
Vianney Perchet
,
Noureddine El Karoui
dInternational Conference on Artificial Intelligence and Statistics, 2020, virtual, France
Conference papers
hal-03089777v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Sparse Stochastic Bandits
Joon Kwon
,
Vianney Perchet
,
Claire Vernade
COLT, May 2017, Amsterdam, Netherlands
Conference papers
hal-02287913v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Learning in repeated auctions
Thomas Nedelec
,
Clément Calauzènes
,
Noureddine El Karoui
,
Vianney Perchet
2020
Preprints, Working Papers, ...
hal-03089800v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Approachability of convex sets in generalized quitting games
János Flesch
,
Rida Laraki
,
Vianney Perchet
Conference On Learning Theory, Jun 2016, New York, United States
Conference papers
hal-01373174v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Approchabilité, Calibration et Regret dans les Jeux à Observations Partielles
Vianney Perchet
Mathématiques [math]. Université Pierre et Marie Curie - Paris VI, 2010. Français. ⟨NNT : ⟩
Theses
tel-00567079v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Internal Regret with Partial Monitoring; Calibration-Based Optimal Algorithms
Vianney Perchet
2011
Preprints, Working Papers, ...
hal-00567094v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Utility/Privacy Trade-off through the lens of Optimal Transport
Etienne Boursier
,
Vianney Perchet
International Conference on Artificial Intelligence and Statistics, 2020, Virtual, France
Conference papers
hal-03089773v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Exploiting structure of uncertainty for efficient matroid semi-bandits
Pierre Perrault
,
Vianney Perchet
,
Michal Valko
International Conference on Machine Learning, 2019, Long Beach, United States
Conference papers
hal-02387478v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits
Etienne Boursier
,
Vianney Perchet
NIPS Proceedings, 2019
Journal articles
hal-02371008v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Finding the bandit in a graph: Sequential search-and-stop
Pierre Perrault
,
Vianney Perchet
,
Michal Valko
International Conference on Artificial Intelligence and Statistics, 2019, Okinawa, Japan
Conference papers
hal-02387465v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Gains and losses are fundamentally different in regret minimization: the sparse case
Joon Kwon
,
Vianney Perchet
Journal of Machine Learning Research, 2016, 17 (227), pp.1-32
Journal articles
hal-02630070v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Regularized Contextual Bandits
Xavier Fontaine
,
Quentin Berthet
,
Vianney Perchet
The 22nd International Conference on Artificial Intelligence and Statistics (AISTATS) 2019, Apr 2019, Naha, Japan
Conference papers
hal-02457917v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
A survey on multi-player bandits
Etienne Boursier
,
Vianney Perchet
2022
Preprints, Working Papers, ...
hal-03941302v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Approachability of convex sets in generalized quitting games
Janos Flesh
,
Rida Laraki
,
Vianney Perchet
Journal articles
hal-02296562v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case
Vianney Perchet
,
Joon Kwon
2015
Preprints, Working Papers, ...
hal-01265075v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Categorized Bandits
Matthieu Jedor
,
Jonathan Louëdec
,
Vianney Perchet
Advances in Neural Information Processing Systems, 2019, Long Beach, France
Conference papers
hal-03089789v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Stochastic Mirror Descent for Large-Scale Sparse Recovery
Yannis Bekri
,
Sasila Ilandarideva
,
Anatoli B. Juditsky
,
Vianney Perchet
2022
Preprints, Working Papers, ...
hal-03826176v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Online Learning and Blackwell Approachability in Quitting Games
János Flesch
,
Rida Laraki
,
Vianney Perchet
COLT 29th Annual Conference on Learning Theory PMLR, Jun 2016, New York, United States
Conference papers
hal-03767990v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Static Scheduling with Predictions Learned through Efficient Exploration
Hugo Richard
,
Flore Sentenac
,
Corentin Odic
,
Mathieu Molina
,
Vianney Perchet
et al.
2023
Preprints, Working Papers, ...
hal-03941374v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Revenue-Maximizing Auctions: A Bidder’s Standpoint
Thomas Nedelec
,
Clément Calauzènes
,
Vianney Perchet
,
Noureddine El Karoui
Journal articles
hal-03951434v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Approachability in unknown games: Online learning meets multi-objective optimization
Shie Mannor
,
Vianney Perchet
,
Gilles Stoltz
2016
Preprints, Working Papers, ...
hal-00943664v2
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Approachability, Regret and Calibration; implications and equivalences.
Vianney Perchet
2013
Preprints, Working Papers, ...
hal-00773218v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Robust approachability and regret minimization in games with partial monitoring
Shie Mannor
,
Vianney Perchet
,
Gilles Stoltz
2012
Preprints, Working Papers, ...
hal-00595695v3
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|