| Privacy Amplification via Shuffling for Linear Contextual Bandits | 0 | 0.34 | 2022 |
| Social Learning in Non-Stationary Environments | 0 | 0.34 | 2022 |
| An Algorithmic Solution to the Blotto Game using Multi-marginal Couplings | 0 | 0.34 | 2022 |
| Encrypted Linear Contextual Bandit | 0 | 0.34 | 2022 |
| Online A-Optimal Design And Active Linear Regression | 0 | 0.34 | 2021 |
| Decentralized Learning in Online Queuing Systems. | 0 | 0.34 | 2021 |
| Adversarial Learning in Revenue-Maximizing Auctions. | 0 | 0.34 | 2021 |
| Local Differential Privacy for Regret Minimization in Reinforcement Learning. | 0 | 0.34 | 2021 |
| Pure Exploration and Regret Minimization in Matching Bandits | 0 | 0.34 | 2021 |
| Covariance-adapting algorithm for semi-bandits with application to sparse outcomes. | 0 | 0.34 | 2020 |
| Trajectory Representation Learning For Multi-Task Nmrdp Planning | 0 | 0.34 | 2020 |
| Selfish Robustness and Equilibria in Multi-Player Bandits | 0 | 0.34 | 2020 |
| Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits | 0 | 0.34 | 2020 |
| Robustness of Community Detection to Random Geometric Perturbations | 0 | 0.34 | 2020 |
| A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players. | 0 | 0.34 | 2020 |
| An adaptive stochastic optimization algorithm for resource allocation. | 0 | 0.34 | 2020 |
| Finding Robust Nash equilibria. | 0 | 0.34 | 2020 |
| Learning to Bid in Revenue Maximizing Auction | 0 | 0.34 | 2019 |
| A Problem-Adaptive Algorithm for Resource Allocation. | 0 | 0.34 | 2019 |
| Exploiting Structure of Uncertainty for Efficient Combinatorial Semi-Bandits. | 0 | 0.34 | 2019 |
| Repeated A/B Testing. | 0 | 0.34 | 2019 |
| Learning to bid in revenue-maximizing auctions. | 0 | 0.34 | 2019 |
| Robust Stackelberg buyers in repeated auctions. | 0 | 0.34 | 2019 |
| Exploiting structure of uncertainty for efficient matroid semi-bandits. | 0 | 0.34 | 2019 |
| Active Linear Regression. | 0 | 0.34 | 2019 |
| SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits. | 1 | 0.36 | 2018 |
| Approachability of convex sets in generalized quitting games. | 0 | 0.34 | 2018 |
| Dynamic Pricing with Finitely Many Unknown Valuations. | 0 | 0.34 | 2018 |
| Explicit shading strategies for repeated truthful auctions. | 0 | 0.34 | 2018 |
| Bandits With Side Observations: Bounded Vs. Logarithmic Regret | 0 | 0.34 | 2018 |
| A differential game on Wasserstein space. Application to weak approachability with partial monitoring. | 0 | 0.34 | 2018 |
| Thresholding the virtual value: a simple method to increase welfare and lower reserve prices in online auction systems. | 0 | 0.34 | 2018 |
| A comparative study of counterfactual estimators. | 2 | 0.37 | 2017 |
| Stochastic Bandit Models For Delayed Conversions | 2 | 0.38 | 2017 |
| Sparse Stochastic Bandits. | 0 | 0.34 | 2017 |
| Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe | 1 | 0.36 | 2017 |
| Anytime optimal algorithms in stochastic multi-armed bandits. | 1 | 0.38 | 2016 |
| Quantitative Analysis of Dynamic Fault Trees Based on the Coupling of Structure Functions and Monte Carlo Simulation. | 6 | 0.45 | 2016 |
| Highly-Smooth Zero-th Order Online Optimization. | 4 | 0.41 | 2016 |
| Online Learning and Blackwell Approachability in Quitting Games. | 0 | 0.34 | 2016 |
| Combinatorial semi-bandit with known covariance. | 0 | 0.34 | 2016 |
| Exponential Weight Approachability, Applications to Calibration and Regret Minimization | 0 | 0.34 | 2015 |
| Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case | 1 | 0.40 | 2015 |
| On a Unified Framework for Approachability with Full or Partial Monitoring | 0 | 0.34 | 2015 |
| Online learning in repeated auctions | 13 | 0.61 | 2015 |
| Set-valued approachability and online learning with partial monitoring | 4 | 0.53 | 2014 |
| Approachability in unknown games: Online learning meets multi-objective optimization. | 2 | 0.39 | 2014 |
| A note on robust Nash equilibria with uncertainties. | 0 | 0.34 | 2014 |
| Nash equilibria with partial monitoring; Computation and Lemke-Howson algorithm | 0 | 0.34 | 2013 |
| Approachability, Regret And Calibration: Implications And Equivalences | 8 | 0.51 | 2013 |
