blackwell approachability

Blackwell Approachability and Gradient Equilibrium are Equivalent COLT 2026 Efficient Opportunistic Approachability ALT 2026 Simultaneous Blackwell Approachability and Applications to Multiclass Omniprediction COLT 2026 Rate-Preserving Reductions for Blackwell Approachability COLT 2025 Dueling over Dessert, Mastering the Art of Repeated Cake Cutting NeurIPS 2024 Extensive-Form Game Solving via Blackwell Approachability on Treeplexes NeurIPS 2024 Faster Recalibration of an Online Predictor via Approachability AISTATS 2024 A Unified Approach to Fair Online Learning via Blackwell Approachability NeurIPS 2021 Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent AAAI 2021 Provably Efficient Algorithms for Multi-Objective Competitive RL ICML 2021 Refined approachability algorithms and application to regret minimization with global costs JMLR 2021 Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds NeurIPS 2020 Preference learning along multiple criteria: A game-theoretic perspective NeurIPS 2020 No-regret algorithms for online k-submodular maximization AISTATS 2019 Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates AISTATS 2017 Online Learning and Blackwell Approachability in Quitting Games COLT 2016 Approachability, fast and slow COLT 2013 Blackwell Approachability and No-Regret Learning are Equivalent COLT 2011 Online Learning: Beyond Regret COLT 2011