| Publication | Date of Publication | Type |
|---|
Online matching in geometric random graphs
Mathematics of Operations Research | 2026-06-12 | Paper |
Optimal unimodular matchings
Probability Theory and Related Fields | 2026-05-27 | Paper |
| An adaptive stochastic optimization algorithm for resource allocation | 2025-02-19 | Paper |
| Privacy amplification via shuffling for linear contextual bandits | 2025-02-11 | Paper |
| Dynamic pricing with finitely many unknown valuations | 2025-01-31 | Paper |
An algorithmic solution to the Blotto game using multimarginal couplings
Operations Research | 2024-12-20 | Paper |
Utility/privacy trade-off as regularized optimal transport
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Revenue-maximizing auctions: a bidder's standpoint
Operations Research | 2022-12-01 | Paper |
Learning in repeated auctions
Foundations and Trends® in Machine Learning | 2022-06-03 | Paper |
A differential game on Wasserstein space. Application to weak approachability with partial monitoring
Journal of Dynamics and Games | 2019-10-01 | Paper |
Approachability of convex sets in generalized quitting games
Games and Economic Behavior | 2018-07-12 | Paper |
Batched bandit problems
The Annals of Statistics | 2016-05-12 | Paper |
Batched bandit problems
The Annals of Statistics | 2016-05-12 | Paper |
Online learning and game theory. A quick overview with recent results and applications
European Series in Applied and Industrial Mathematics (ESAIM): Proceedings and Surveys | 2016-02-15 | Paper |
On a unified framework for approachability with full or partial monitoring
Mathematics of Operations Research | 2015-11-04 | Paper |
| A minmax theorem for concave-convex mappings with no regularity assumptions | 2015-07-13 | Paper |
Exponential weight approachability, applications to calibration and regret minimization
Dynamic Games and Applications | 2015-04-29 | Paper |
A primal condition for approachability with partial monitoring
Journal of Dynamics and Games | 2015-01-05 | Paper |
| Set-valued approachability and online learning with partial monitoring | 2014-12-08 | Paper |
A note on robust Nash equilibria with uncertainties
RAIRO. Operations Research | 2014-08-08 | Paper |
Approachability, regret and calibration: implications and equivalences
Journal of Dynamics and Games | 2014-03-11 | Paper |
| Internal regret with partial monitoring: calibration-based optimal algorithms | 2014-02-03 | Paper |
Internal regret with partial monitoring: calibration-based optimal algorithms
(available as arXiv preprint) | 2014-02-03 | Paper |
The multi-armed bandit problem with covariates
The Annals of Statistics | 2013-07-24 | Paper |
The multi-armed bandit problem with covariates
The Annals of Statistics | 2013-07-24 | Paper |
Approachability of convex sets in games with partial monitoring
Journal of Optimization Theory and Applications | 2011-09-06 | Paper |
Calibration and internal no-regret with random signals
Lecture Notes in Computer Science | 2009-12-01 | Paper |
