The following pages link to Vianney Perchet (Q282460):
Displaying 20 items.
- Batched bandit problems (Q282463) (← links)
- The multi-armed bandit problem with covariates (Q355096) (← links)
- A primal condition for approachability with partial monitoring (Q482547) (← links)
- Approachability of convex sets in games with partial monitoring (Q637538) (← links)
- Approachability of convex sets in generalized quitting games (Q1651293) (← links)
- A differential game on Wasserstein space. Application to weak approachability with partial monitoring (Q2274621) (← links)
- Exponential weight approachability, applications to calibration and regret minimization (Q2342741) (← links)
- Approachability, regret and calibration: implications and equivalences (Q2438352) (← links)
- Online Learning and Game Theory. A Quick Overview with recent results and applications (Q2786537) (← links)
- A note on robust Nash equilibria with uncertainties (Q2874628) (← links)
- (Q2934107) (← links)
- On a Unified Framework for Approachability with Full or Partial Monitoring (Q3449449) (← links)
- Calibration and Internal No-Regret with Random Signals (Q3648743) (← links)
- Revenue-Maximizing Auctions: A Bidder’s Standpoint (Q5058041) (← links)
- (Q5262226) (← links)
- Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms (Q5396662) (← links)
- Learning in Repeated Auctions (Q5863991) (← links)
- Utility/privacy trade-off as regularized optimal transport (Q6201932) (← links)
- An algorithmic solution to the Blotto game using multimarginal couplings (Q6655183) (← links)
- Optimal Unimodular Matching (Q6735040) (← links)
