{"total":98,"rows":[{"id":"2312.00886","title":"Nash Learning from Human Feedback","created":"2023-12-01","cited_by_count":224,"area":"alignment"},{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101,"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":"2105.15186","title":"Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization","created":"2021-05-31","cited_by_count":63,"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":"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":"2201.12736","title":"No-Regret Learning in Time-Varying Zero-Sum Games","created":"2022-01-30","cited_by_count":36,"area":null},{"id":"2102.09468","title":"Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization","created":"2021-02-18","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":"2306.11700","title":"Last-Iterate Convergent Policy Gradient Primal-Dual Methods for Constrained MDPs","created":"2023-06-20","cited_by_count":28,"area":null},{"id":"2210.01050","title":"Faster Last-iterate Convergence of Policy Optimization in Zero-Sum Markov Games","created":"2022-10-03","cited_by_count":26,"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":"2106.12928","title":"Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality","created":"2021-06-24","cited_by_count":21,"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":"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":"2302.01275","title":"ReLOAD: Reinforcement Learning with Optimistic Ascent-Descent for Last-Iterate Convergence in Constrained MDPs","created":"2023-02-02","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":"2204.09228","title":"Tight Last-Iterate Convergence of the Extragradient and the Optimistic Gradient Descent-Ascent Algorithm for Constrained Monotone Variational Inequalities","created":"2022-04-20","cited_by_count":19,"area":null},{"id":"2103.07780","title":"Online Double Oracle","created":"2021-03-13","cited_by_count":18,"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":"2408.11974","title":"Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization","created":"2024-08-21","cited_by_count":16,"area":null},{"id":"2503.08942","title":"Extragradient Preference Optimization (EGPO): Beyond Last-Iterate Convergence for Nash Learning from Human Feedback","created":"2025-03-11","cited_by_count":16,"area":"alignment"},{"id":"2211.01280","title":"An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games","created":"2022-11-02","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":"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":"2212.08791","title":"Two-Scale Gradient Descent Ascent Dynamics Finds Mixed Nash Equilibria of Continuous Games: A Mean-Field Perspective","created":"2022-12-17","cited_by_count":13,"area":null},{"id":"2107.01906","title":"The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities","created":"2021-07-05","cited_by_count":12,"area":null},{"id":"2312.01127","title":"Symmetric Mean-field Langevin Dynamics for Distributional Minimax Problems","created":"2023-12-02","cited_by_count":11,"area":null},{"id":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10,"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":"2307.09470","title":"Multi-Player Zero-Sum Markov Games with Networked Separable Interactions","created":"2023-07-13","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":"2505.20659","title":"An Optimisation Framework for Unsupervised Environment Design","created":"2025-05-27","cited_by_count":10,"area":"deeprl"},{"id":"2208.09855","title":"Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games","created":"2022-08-21","cited_by_count":9,"area":null},{"id":"2305.16610","title":"Adaptively Perturbed Mirror Descent for Learning in Games","created":"2023-05-26","cited_by_count":9,"area":null},{"id":"2101.05248","title":"Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent","created":"2021-01-13","cited_by_count":8,"area":null},{"id":"2110.03906","title":"Nash Convergence of Mean-Based Learning Algorithms in First-Price Auctions","created":"2021-10-08","cited_by_count":8,"area":null},{"id":"2110.03950","title":"Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain","created":"2021-10-08","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.12812","title":"Symmetric (Optimistic) Natural Policy Gradient for Multi-agent Learning with Parameter Convergence","created":"2022-10-23","cited_by_count":8,"area":null},{"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":"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":"2210.09371","title":"On Accelerated Perceptrons and Beyond","created":"2022-10-17","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":"2203.14126","title":"Robust No-Regret Learning in Min-Max Stackelberg Games","created":"2022-03-26","cited_by_count":5,"area":null},{"id":"2211.08980","title":"Asynchronous Gradient Play in Zero-Sum Multi-agent Games","created":"2022-11-16","cited_by_count":5,"area":null},{"id":"2401.17743","title":"Algorithmic Robust Forecast Aggregation","created":"2024-01-31","cited_by_count":5,"area":null},{"id":"2408.00751","title":"A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence","created":"2024-08-01","cited_by_count":5,"area":"deeprl"},{"id":"2103.00284","title":"On the Initialization for Convex-Concave Min-max Problems","created":"2021-02-27","cited_by_count":4,"area":null},{"id":"2203.14129","title":"Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics","created":"2022-03-26","cited_by_count":4,"area":null},{"id":"2206.09120","title":"Pursuit of a Discriminative Representation for Multiple Subspaces via Sequential Games","created":"2022-06-18","cited_by_count":4,"area":null},{"id":"2207.08426","title":"Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games","created":"2022-07-18","cited_by_count":4,"area":null},{"id":"2210.09769","title":"STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games","created":"2022-10-18","cited_by_count":4,"area":null},{"id":"2301.03931","title":"Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps","created":"2023-01-10","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":"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":"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":"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":"2110.03604","title":"Online Markov Decision Processes with Non-oblivious Strategic Adversary","created":"2021-10-07","cited_by_count":3,"area":null},{"id":"2206.10575","title":"Solving Constrained Variational Inequalities via a First-order Interior Point-based Method","created":"2022-06-21","cited_by_count":3,"area":null},{"id":"2207.07971","title":"A Survey of Decision Making in Adversarial Games","created":"2022-07-16","cited_by_count":3,"area":null},{"id":"2207.08894","title":"A Deep Reinforcement Learning Approach for Finding Non-Exploitable Strategies in Two-Player Atari Games","created":"2022-07-18","cited_by_count":3,"area":null},{"id":"2405.15834","title":"A Fisher-Rao gradient flow for entropic mean-field min-max games","created":"2024-05-24","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":"2406.10605","title":"Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games","created":"2024-06-15","cited_by_count":3,"area":null},{"id":"2502.09780","title":"Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games","created":"2025-02-13","cited_by_count":3,"area":null},{"id":"2502.14096","title":"Aligned Multi Objective Optimization","created":"2025-02-19","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":"2202.06460","title":"Simultaneous Transport Evolution for Minimax Equilibria on Measures","created":"2022-02-14","cited_by_count":2,"area":null},{"id":"2301.13006","title":"Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods","created":"2023-01-30","cited_by_count":2,"area":null},{"id":"2306.16617","title":"Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation","created":"2023-06-29","cited_by_count":2,"area":null},{"id":"2310.05230","title":"Global Convergence of Policy Gradient Methods in Reinforcement Learning, Games and Control","created":"2023-10-08","cited_by_count":2,"area":null},{"id":"2505.07642","title":"Convergence of Time-Averaged Mean Field Gradient Descent Dynamics for Continuous Multi-Player Zero-Sum Games","created":"2025-05-12","cited_by_count":2,"area":null},{"id":"2506.16736","title":"Optimism Without Regularization: Constant Regret in Zero-Sum Games","created":"2025-06-20","cited_by_count":2,"area":null},{"id":"2510.11691","title":"Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games","created":"2025-10-13","cited_by_count":2,"area":null},{"id":"2510.18183","title":"NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria","created":"2025-10-21","cited_by_count":2,"area":"deeprl"},{"id":"2106.02615","title":"Consensus Multiplicative Weights Update: Learning to Learn using Projector-based Game Signatures","created":"2021-06-04","cited_by_count":1,"area":null},{"id":"2111.04178","title":"Towards convergence to Nash equilibria in two-team zero-sum games","created":"2021-11-07","cited_by_count":1,"area":null},{"id":"2208.09452","title":"Unified Policy Optimization for Continuous-action Reinforcement Learning in Non-stationary Tasks and Games","created":"2022-08-19","cited_by_count":1,"area":null},{"id":"2501.16600","title":"On the Power of Perturbation under Sampling in Solving Extensive-Form Games","created":"2025-01-28","cited_by_count":1,"area":null},{"id":"2505.12609","title":"Hamiltonian of polymatrix zero-sum games","created":"2025-05-19","cited_by_count":1,"area":null},{"id":"2602.08041","title":"Implicit Strategic Optimization: Rethinking Long-Horizon Decision-Making in Adversarial Poker Environments","created":"2026-02-08","cited_by_count":1,"area":"lr"},{"id":"2109.03974","title":"Constants of Motion: The Antidote to Chaos in Optimization and Game Dynamics","created":"2021-09-08","cited_by_count":0,"area":null},{"id":"2203.07136","title":"On the Nash equilibrium of moment-matching GANs for stationary Gaussian processes","created":"2022-03-14","cited_by_count":0,"area":null},{"id":"2210.11402","title":"Learning Rationalizable Equilibria in Multiplayer Games","created":"2022-10-20","cited_by_count":0,"area":null},{"id":"2302.06652","title":"Achieving Better Regret against Strategic Adversaries","created":"2023-02-13","cited_by_count":0,"area":null},{"id":"2305.17544","title":"Faster Margin Maximization Rates for Generic and Adversarially Robust Optimization Methods","created":"2023-05-27","cited_by_count":0,"area":null},{"id":"2406.04201","title":"Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games","created":"2024-06-06","cited_by_count":0,"area":null},{"id":"2502.08063","title":"Last-iterate Convergence for Symmetric, General-sum, $2 \\times 2$ Games Under The Exponential Weights Dynamic","created":"2025-02-12","cited_by_count":0,"area":null},{"id":"2507.11366","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","created":"2025-07-15","cited_by_count":0,"area":null},{"id":"2508.18877","title":"Optimization of Latent-Space Compression using Game-Theoretic Techniques for Transformer-Based Vector Search","created":"2025-08-26","cited_by_count":0,"area":null},{"id":"2510.14907","title":"Learnable Mixed Nash Equilibria are Collectively Rational","created":"2025-10-16","cited_by_count":0,"area":null},{"id":"2512.24818","title":"Unregularized Linear Convergence in Zero-Sum Game from Preference Feedback","created":"2025-12-31","cited_by_count":0,"area":"alignment"},{"id":"2605.31388","title":"Constrained Multi-Objective Reinforcement Learning with Max-Min Criterion","created":"2026-05-29","cited_by_count":0,"area":"deeprl"},{"id":"2606.11773","title":"Last-Iterate Convergence of Optimistic Multiplicative Weight Update","created":"2026-06-10","cited_by_count":0,"area":null},{"id":"2607.17560","title":"Reinforcement Learning: From Algorithms To Foundation Models","created":"2026-07-20","cited_by_count":0,"area":"wm"},{"id":"2610.05968","title":"Fast Last-Iterate Convergence in Zero-Sum Markov Games with Bandit Feedback","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}