{"total":117,"rows":[{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101,"area":null},{"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":"2105.15186","title":"Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization","created":"2021-05-31","cited_by_count":63,"area":null},{"id":"2111.01207","title":"Sig-Wasserstein GANs for Time Series Generation","created":"2021-11-01","cited_by_count":60,"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":"2103.00623","title":"Scaling up Mean Field Games with Online Mirror Descent","created":"2021-02-28","cited_by_count":32,"area":null},{"id":"2303.02738","title":"Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback","created":"2023-03-05","cited_by_count":30,"area":null},{"id":"2106.14326","title":"Last-iterate Convergence in Extensive-Form Games","created":"2021-06-27","cited_by_count":28,"area":null},{"id":"2105.08158","title":"The Confluence of Networks, Games and Learning","created":"2021-05-17","cited_by_count":26,"area":null},{"id":"2107.13090","title":"Policy Gradient Methods Find the Nash Equilibrium in N-player General-sum Linear-quadratic Games","created":"2021-07-27","cited_by_count":25,"area":null},{"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":"2106.12928","title":"Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality","created":"2021-06-24","cited_by_count":21,"area":null},{"id":"2204.02567","title":"FairNeuron: Improving Deep Neural Network Fairness with Adversary Games on Selective Neurons","created":"2022-04-06","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":"2302.09831","title":"Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems","created":"2023-02-20","cited_by_count":21,"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":"2305.19496","title":"Is Learning in Games Good for the Learners?","created":"2023-05-31","cited_by_count":20,"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":"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":"2210.08857","title":"On the convergence of policy gradient methods to Nash equilibria in general stochastic games","created":"2022-10-17","cited_by_count":16,"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":"2112.02856","title":"Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback","created":"2021-12-06","cited_by_count":15,"area":null},{"id":"2209.03880","title":"Learning Sparse Graphon Mean Field Games","created":"2022-09-08","cited_by_count":14,"area":null},{"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.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":"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":"2206.04160","title":"Alternating Mirror Descent for Constrained Min-Max Games","created":"2022-06-08","cited_by_count":13,"area":null},{"id":"2204.11418","title":"Riemannian Hamiltonian methods for min-max optimization on manifolds","created":"2022-04-25","cited_by_count":12,"area":null},{"id":"2103.03405","title":"Learning in Matrix Games can be Arbitrarily Complex","created":"2021-03-05","cited_by_count":11,"area":null},{"id":"2111.03377","title":"Online Learning in Periodic Zero-Sum Games","created":"2021-11-05","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":"2207.00957","title":"On Convergence of Gradient Descent Ascent: A Tight Local Analysis","created":"2022-07-03","cited_by_count":9,"area":null},{"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":"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":"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":"2112.13826","title":"Last-Iterate Convergence of Saddle-Point Optimizers via High-Resolution Differential Equations","created":"2021-12-27","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.09619","title":"Asymptotic Convergence and Performance of Multi-Agent Q-Learning Dynamics","created":"2023-01-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":"2310.14085","title":"Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback","created":"2023-10-21","cited_by_count":6,"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":"2203.14129","title":"Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics","created":"2022-03-26","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":"2302.02333","title":"Learning in quantum games","created":"2023-02-05","cited_by_count":4,"area":null},{"id":"2308.03239","title":"Unsynchronized Decentralized Q-Learning: Two Timescale Analysis By Persistence","created":"2023-08-07","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":"2405.07224","title":"A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights","created":"2024-05-12","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":"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":"2202.07068","title":"Motivating Physical Activity via Competitive Human-Robot Interaction","created":"2022-02-14","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":"2209.15230","title":"The Replicator Dynamic, Chain Components and the Response Graph","created":"2022-09-30","cited_by_count":3,"area":null},{"id":"2310.17759","title":"Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization","created":"2023-10-26","cited_by_count":3,"area":null},{"id":"2311.00582","title":"Minimally Modifying a Markov Game to Achieve Any Nash Equilibrium and Value","created":"2023-11-01","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":"2106.10022","title":"Local AdaGrad-Type Algorithm for Stochastic Convex-Concave Optimization","created":"2021-06-18","cited_by_count":2,"area":null},{"id":"2106.14668","title":"Evolutionary Dynamics and $\\Phi$-Regret Minimization in Games","created":"2021-06-28","cited_by_count":2,"area":null},{"id":"2202.11871","title":"No-Regret Learning in Games is Turing Complete","created":"2022-02-24","cited_by_count":2,"area":null},{"id":"2210.16482","title":"Recursive Reasoning in Minimax Games: A Level $k$ Gradient Play Method","created":"2022-10-29","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":"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.10207","title":"Learning to Steer Markovian Agents under Model Uncertainty","created":"2024-07-14","cited_by_count":2,"area":null},{"id":"2412.20365","title":"Accelerated regularized learning in finite N-person games","created":"2024-12-29","cited_by_count":2,"area":null},{"id":"2501.17122","title":"Convergence of two-timescale gradient descent ascent dynamics: finite-dimensional and mean-field perspectives","created":"2025-01-28","cited_by_count":2,"area":null},{"id":"2503.02825","title":"On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games","created":"2025-03-04","cited_by_count":2,"area":null},{"id":"2506.13286","title":"The impact of uncertainty on regularized learning in games","created":"2025-06-16","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":"2606.28308","title":"Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopes","created":"2026-06-26","cited_by_count":2,"area":null},{"id":"2102.10485","title":"Scalable Balanced Training of Conditional Generative Adversarial Neural Networks on Image Data","created":"2021-02-21","cited_by_count":1,"area":null},{"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":"2111.09982","title":"Second-Order Mirror Descent: Convergence in Games Beyond Averaging and Discounting","created":"2021-11-18","cited_by_count":1,"area":null},{"id":"2205.00473","title":"A Survey on Distributed Online Optimization and Game","created":"2022-05-01","cited_by_count":1,"area":null},{"id":"2207.07105","title":"Continuous-time Analysis for Variational Inequalities: An Overview and Desiderata","created":"2022-07-14","cited_by_count":1,"area":null},{"id":"2405.17463","title":"Is Thompson Sampling Susceptible to Algorithmic Collusion?","created":"2024-05-23","cited_by_count":1,"area":null},{"id":"2408.11146","title":"Swim till You Sink: Computing the Limit of a Game","created":"2024-08-20","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":"2509.22426","title":"Learning from Delayed Feedback in Games via Extra Prediction","created":"2025-09-26","cited_by_count":1,"area":null},{"id":"2511.06597","title":"Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality","created":"2025-11-10","cited_by_count":1,"area":null},{"id":"2605.13806","title":"Min-Max Optimization Requires Exponentially Many Queries","created":"2026-05-13","cited_by_count":1,"area":null},{"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":"2205.06968","title":"No-regret learning for repeated non-cooperative games with lossy bandits","created":"2022-05-14","cited_by_count":0,"area":null},{"id":"2207.12315","title":"Stable Parallel Training of Wasserstein Conditional Generative Adversarial Neural Networks","created":"2022-07-25","cited_by_count":0,"area":null},{"id":"2302.03438","title":"Uncoupled Learning of Differential Stackelberg Equilibria with Commitments","created":"2023-02-07","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":"2304.04665","title":"On algorithmically boosting fixed-point computations","created":"2023-04-04","cited_by_count":0,"area":null}],"next_cursor":"100"}