{"total":150,"rows":[{"id":"2312.00886","title":"Nash Learning from Human Feedback","created":"2023-12-01","cited_by_count":224,"area":"alignment"},{"id":"2106.01969","title":"Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games","created":"2021-06-03","cited_by_count":93,"area":null},{"id":"2108.06924","title":"Near-Optimal No-Regret Learning in General Games","created":"2021-08-16","cited_by_count":85,"area":null},{"id":"2102.04540","title":"Last-iterate Convergence of Decentralized Optimistic Gradient Descent/Ascent in Infinite-horizon Competitive Markov Games","created":"2021-02-08","cited_by_count":69,"area":null},{"id":"2110.04184","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently?","created":"2021-10-08","cited_by_count":67,"area":null},{"id":"2112.14368","title":"Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization","created":"2021-12-29","cited_by_count":66,"area":null},{"id":"2105.15186","title":"Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization","created":"2021-05-31","cited_by_count":63,"area":null},{"id":"2102.01046","title":"Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications","created":"2021-02-01","cited_by_count":52,"area":null},{"id":"2104.12761","title":"Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium","created":"2021-04-26","cited_by_count":51,"area":null},{"id":"2407.00617","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","created":"2024-06-30","cited_by_count":45,"area":"alignment"},{"id":"2111.06008","title":"Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games","created":"2021-11-11","cited_by_count":43,"area":null},{"id":"2110.05707","title":"On Improving Model-Free Algorithms for Decentralized Multi-Agent Reinforcement Learning","created":"2021-10-12","cited_by_count":36,"area":null},{"id":"2201.12736","title":"No-Regret Learning in Time-Varying Zero-Sum Games","created":"2022-01-30","cited_by_count":36,"area":null},{"id":"2204.11417","title":"Uncoupled Learning Dynamics with $O(\\log T)$ Swap Regret in Multiplayer Games","created":"2022-04-25","cited_by_count":35,"area":null},{"id":"2106.06885","title":"Online Learning with Optimism and Delay","created":"2021-06-13","cited_by_count":33,"area":null},{"id":"2310.19647","title":"Fast swap regret minimization and applications to approximate correlated equilibria","created":"2023-10-30","cited_by_count":32,"area":null},{"id":"2110.02924","title":"No-Press Diplomacy from Scratch","created":"2021-10-06","cited_by_count":31,"area":null},{"id":"2106.14326","title":"Last-iterate Convergence in Extensive-Form Games","created":"2021-06-27","cited_by_count":28,"area":null},{"id":"2202.01312","title":"Causal Imitation Learning under Temporally Correlated Noise","created":"2022-02-02","cited_by_count":28,"area":"offlinerl"},{"id":"2207.02121","title":"Adapting to Online Label Shift with Provable Guarantees","created":"2022-07-05","cited_by_count":26,"area":null},{"id":"2205.15397","title":"Minimax Optimal Online Imitation Learning via Replay Estimation","created":"2022-05-30","cited_by_count":25,"area":"offlinerl"},{"id":"2206.08742","title":"Near-Optimal No-Regret Learning Dynamics for General Convex Games","created":"2022-06-17","cited_by_count":25,"area":null},{"id":"2207.14211","title":"Regret Minimization and Convergence to Equilibria in General-sum Markov Games","created":"2022-07-28","cited_by_count":24,"area":null},{"id":"2502.16852","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","created":"2025-02-24","cited_by_count":24,"area":"alignment"},{"id":"2101.04667","title":"Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information","created":"2021-01-12","cited_by_count":23,"area":null},{"id":"2206.03922","title":"A unified stochastic approximation framework for learning in games","created":"2022-06-08","cited_by_count":23,"area":null},{"id":"2302.04552","title":"Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization","created":"2023-02-09","cited_by_count":22,"area":null},{"id":"2206.09495","title":"The Power of Regularization in Solving Extensive-Form Games","created":"2022-06-19","cited_by_count":21,"area":null},{"id":"2111.11309","title":"No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization","created":"2021-11-22","cited_by_count":20,"area":null},{"id":"2111.14737","title":"Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update","created":"2021-11-29","cited_by_count":20,"area":null},{"id":"2301.13306","title":"Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics","created":"2023-01-30","cited_by_count":20,"area":null},{"id":"2202.00237","title":"Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games","created":"2022-02-01","cited_by_count":19,"area":null},{"id":"2112.07640","title":"How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agents","created":"2021-12-14","cited_by_count":17,"area":null},{"id":"2111.08911","title":"Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games","created":"2021-11-17","cited_by_count":16,"area":null},{"id":"2206.02640","title":"Policy Optimization for Markov Games: Unified Framework and Faster Convergence","created":"2022-06-06","cited_by_count":16,"area":null},{"id":"2102.06973","title":"Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games","created":"2021-02-13","cited_by_count":15,"area":null},{"id":"2110.03313","title":"Distributed Methods with Compressed Communication for Solving Variational Inequalities, with Theoretical Guarantees","created":"2021-10-07","cited_by_count":15,"area":null},{"id":"2309.08911","title":"Efficient Methods for Non-stationary Online Learning","created":"2023-09-16","cited_by_count":15,"area":null},{"id":"2301.11241","title":"On the Convergence of No-Regret Learning Dynamics in Time-Varying Games","created":"2023-01-26","cited_by_count":14,"area":null},{"id":"2301.13120","title":"Doubly Optimal No-Regret Learning in Monotone Games","created":"2023-01-30","cited_by_count":14,"area":null},{"id":"2305.14709","title":"Regret Matching+: (In)Stability and Fast Convergence in Games","created":"2023-05-24","cited_by_count":14,"area":null},{"id":"2406.10631","title":"Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms","created":"2024-06-15","cited_by_count":14,"area":null},{"id":"2105.12954","title":"Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria","created":"2021-05-27","cited_by_count":13,"area":null},{"id":"2401.15240","title":"Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games","created":"2024-01-26","cited_by_count":13,"area":null},{"id":"2107.06327","title":"Contextual Games: Multi-Agent Learning with Side Information","created":"2021-07-13","cited_by_count":11,"area":null},{"id":"2209.12430","title":"$O(T^{-1})$ Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Games","created":"2022-09-26","cited_by_count":11,"area":null},{"id":"2408.09074","title":"Gradient-Variation Online Learning under Generalized Smoothness","created":"2024-08-17","cited_by_count":11,"area":null},{"id":"2412.08060","title":"An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints","created":"2024-12-11","cited_by_count":11,"area":null},{"id":"2303.04096","title":"Mastering Strategy Card Game (Legends of Code and Magic) via End-to-End Policy and Optimistic Smooth Fictitious Play","created":"2023-03-07","cited_by_count":10,"area":null},{"id":"2303.12287","title":"Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games","created":"2023-03-22","cited_by_count":10,"area":null},{"id":"2502.17625","title":"Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback","created":"2025-02-24","cited_by_count":10,"area":null},{"id":"2503.24340","title":"Faster Rates for No-Regret Learning in General Games via Cautious Optimism","created":"2025-03-31","cited_by_count":10,"area":null},{"id":"2604.06738","title":"Beyond Pessimism: Offline Learning in KL-regularized Games","created":"2026-04-08","cited_by_count":10,"area":null},{"id":"2303.03095","title":"Can We Find Nash Equilibria at a Linear Rate in Markov Games?","created":"2023-03-03","cited_by_count":9,"area":null},{"id":"2307.08360","title":"Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach","created":"2023-07-17","cited_by_count":9,"area":null},{"id":"2111.05884","title":"Search in Imperfect Information Games","created":"2021-11-10","cited_by_count":8,"area":null},{"id":"2206.09254","title":"Mutation-Driven Follow the Regularized Leader for Last-Iterate Convergence in Zero-Sum Games","created":"2022-06-18","cited_by_count":8,"area":null},{"id":"2210.12606","title":"Nash Equilibria and Pitfalls of Adversarial Training in Adversarial Robustness Games","created":"2022-10-23","cited_by_count":8,"area":null},{"id":"2301.02060","title":"A first-order augmented Lagrangian method for constrained minimax optimization","created":"2023-01-05","cited_by_count":8,"area":null},{"id":"2407.04889","title":"Maximizing utility in multi-agent environments by anticipating the behavior of other learners","created":"2024-07-05","cited_by_count":8,"area":null},{"id":"2410.23223","title":"COMAL: A Convergent Meta-Algorithm for Aligning LLMs with General Preferences","created":"2024-10-30","cited_by_count":8,"area":"alignment"},{"id":"2506.03464","title":"From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications","created":"2025-06-04","cited_by_count":8,"area":null},{"id":"2303.10565","title":"Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games","created":"2023-03-19","cited_by_count":7,"area":null},{"id":"2404.13891","title":"Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent","created":"2024-04-22","cited_by_count":7,"area":null},{"id":"2106.03579","title":"Forward Looking Best-Response Multiplicative Weights Update Methods for Bilinear Zero-sum Games","created":"2021-06-07","cited_by_count":6,"area":null},{"id":"2302.08652","title":"Minimizing Dynamic Regret on Geodesic Metric Spaces","created":"2023-02-17","cited_by_count":6,"area":null},{"id":"2304.14197","title":"Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games","created":"2023-04-27","cited_by_count":6,"area":null},{"id":"2311.00676","title":"Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games","created":"2023-11-01","cited_by_count":6,"area":null},{"id":"2105.13203","title":"Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving","created":"2021-05-27","cited_by_count":5,"area":null},{"id":"2501.13358","title":"Learning to Bid in Non-Stationary Repeated First-Price Auctions","created":"2025-01-23","cited_by_count":5,"area":null},{"id":"2503.00419","title":"Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update","created":"2025-03-01","cited_by_count":5,"area":null},{"id":"2511.02276","title":"Gradient-Variation Online Adaptivity for Accelerated Optimization with H\\\"older Smoothness","created":"2025-11-04","cited_by_count":5,"area":null},{"id":"2602.04761","title":"Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations","created":"2026-02-04","cited_by_count":5,"area":null},{"id":"2602.23116","title":"Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferences","created":"2026-02-26","cited_by_count":5,"area":"alignment"},{"id":"2202.12277","title":"Solving optimization problems with Blackwell approachability","created":"2022-02-24","cited_by_count":4,"area":null},{"id":"2311.02407","title":"The equivalence of dynamic and strategic stability under regularized learning in games","created":"2023-11-04","cited_by_count":4,"area":null},{"id":"2406.02357","title":"The complexity of approximate (coarse) correlated equilibrium for incomplete information games","created":"2024-06-04","cited_by_count":4,"area":null},{"id":"2412.07120","title":"Corrupted Learning Dynamics in Games","created":"2024-12-10","cited_by_count":4,"area":null},{"id":"2412.20203","title":"No-regret learning in harmonic games: Extrapolation in the face of conflicting interests","created":"2024-12-28","cited_by_count":4,"area":null},{"id":"2502.07774","title":"Optimistic Interior Point Methods for Sequential Hypothesis Testing by Betting","created":"2025-02-11","cited_by_count":4,"area":null},{"id":"2505.13564","title":"Online Decision-Focused Learning","created":"2025-05-19","cited_by_count":4,"area":null},{"id":"2602.06348","title":"Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret","created":"2026-02-06","cited_by_count":4,"area":null},{"id":"2602.21436","title":"Efficient Uncoupled Learning Dynamics with $\\tilde{O}\\!\\left(T^{-1/4}\\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback","created":"2026-02-24","cited_by_count":4,"area":null},{"id":"2608.04149","title":"Sublogarithmic Swap Regret in Multiplayer General-Sum Games via Hybrid Regularization","created":"2026-08-04","cited_by_count":4,"area":null},{"id":"2101.09603","title":"Optimistic and Adaptive Lagrangian Hedging","created":"2021-01-23","cited_by_count":3,"area":null},{"id":"2106.04748","title":"Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincar\\'e Recurrence","created":"2021-06-09","cited_by_count":3,"area":null},{"id":"2208.09747","title":"Near-Optimal $\\Phi$-Regret Learning in Extensive-Form Games","created":"2022-08-20","cited_by_count":3,"area":null},{"id":"2405.20880","title":"Games with Payments between Learning Agents","created":"2024-05-31","cited_by_count":3,"area":null},{"id":"2407.04591","title":"Proximal Point Method for Online Saddle Point Problem","created":"2024-07-05","cited_by_count":3,"area":null},{"id":"2510.04407","title":"Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games","created":"2025-10-06","cited_by_count":3,"area":null},{"id":"2510.04685","title":"Parameter-free Algorithms for the Stochastically Extended Adversarial Model","created":"2025-10-06","cited_by_count":3,"area":null},{"id":"2511.01852","title":"Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games","created":"2025-11-03","cited_by_count":3,"area":null},{"id":"2608.31166","title":"Constant Individual Regret in General Games","created":"2026-08-31","cited_by_count":3,"area":null},{"id":"2304.03321","title":"Adaptive Decision-Making with Constraints and Dependent Losses: Performance Guarantees and Applications to Online and Nonlinear Identification","created":"2023-04-06","cited_by_count":2,"area":null},{"id":"2304.12768","title":"Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games","created":"2023-04-25","cited_by_count":2,"area":null},{"id":"2306.13673","title":"Taming the Exponential Action Set: Sublinear Regret and Fast Convergence to Nash Equilibrium in Online Congestion Games","created":"2023-06-19","cited_by_count":2,"area":null},{"id":"2308.09187","title":"Distributed Extra-gradient with Optimal Complexity and Communication Guarantees","created":"2023-08-17","cited_by_count":2,"area":null},{"id":"2312.12067","title":"Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property","created":"2023-12-19","cited_by_count":2,"area":null},{"id":"2407.20128","title":"Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games","created":"2024-07-29","cited_by_count":2,"area":null},{"id":"2410.23398","title":"On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games","created":"2024-10-30","cited_by_count":2,"area":null}],"next_cursor":"100"}