two-player game

Adversarial Policy Optimization for Offline Preference-based Reinforcement Learning ICLR 2025 Toward Optimal LLM Alignments Using Two-Player Games EMNLP 2025 Bitrate-Constrained DRO: Beyond Worst Case Robustness To Unknown Group Shifts ICLR 2023 Composing Efficient, Robust Tests for Policy Selection UAI 2023 Online Learning in Stackelberg Games with an Omniscient Follower ICML 2023 Online Learning under Adversarial Nonlinear Constraints NeurIPS 2023 Provable Reset-free Reinforcement Learning by No-Regret Reduction ICML 2023 Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis IJCAI 2022 Gap-Dependent Bounds for Two-Player Markov Games AISTATS 2022 Adversarial Policy Learning in Two-player Competitive Games ICML 2021 Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up IJCAI 2021 Discretization Drift in Two-Player Games ICML 2021 Formalizing the Generalization-Forgetting Trade-off in Continual Learning NeurIPS 2021 Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity AISTATS 2020 Planning in entropy-regularized Markov decision processes and games NeurIPS 2019 Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraints ICML 2019 Two-Player Games for Efficient Non-Convex Constrained Optimization ALT 2019 Balancing Two-Player Stochastic Games with Soft Q-Learning IJCAI 2018 The Numerics of GANs NeurIPS 2017 On the Use of Non-Stationary Strategies for Solving Two-Player Zero-Sum Markov Games AISTATS 2016 Online Optimization : Competing with Dynamic Comparators AISTATS 2015 Blackwell Approachability and No-Regret Learning are Equivalent COLT 2011