{"total":78,"rows":[{"id":"2106.02748","title":"Decentralized Q-Learning in Zero-sum Markov Games","created":"2021-06-04","cited_by_count":58,"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":"2201.03398","title":"Multiplayer Performative Prediction: Learning in Decision-Dependent Games","created":"2022-01-10","cited_by_count":44,"area":null},{"id":"2107.00052","title":"Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity","created":"2021-06-30","cited_by_count":43,"area":null},{"id":"2202.07262","title":"Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methods","created":"2022-02-15","cited_by_count":37,"area":null},{"id":"2111.08611","title":"Stochastic Extragradient: General Analysis and Improved Rates","created":"2021-11-16","cited_by_count":31,"area":null},{"id":"2105.08158","title":"The Confluence of Networks, Games and Learning","created":"2021-05-17","cited_by_count":26,"area":null},{"id":"2110.10117","title":"Beyond Exact Gradients: Convergence of Stochastic Soft-Max Policy Gradient Methods with Entropy Regularization","created":"2021-10-19","cited_by_count":25,"area":null},{"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":"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":"2206.06015","title":"No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation","created":"2022-06-13","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":"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":"2206.01095","title":"Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise","created":"2022-06-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":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","cited_by_count":14,"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":"2102.07974","title":"Follow-the-Regularized-Leader Routes to Chaos in Routing Games","created":"2021-02-16","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":"2303.05197","title":"Mastering Strategy Card Game (Hearthstone) with Improved Techniques","created":"2023-03-09","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":"2204.03132","title":"First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems","created":"2022-04-07","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":"2305.16610","title":"Adaptively Perturbed Mirror Descent for Learning in Games","created":"2023-05-26","cited_by_count":9,"area":null},{"id":"2305.18285","title":"Partially Personalized Federated Learning: Breaking the Curse of Data Heterogeneity","created":"2023-05-29","cited_by_count":9,"area":null},{"id":"2110.01212","title":"Inducing Equilibria via Incentives: Simultaneous Design-and-Play Ensures Global Convergence","created":"2021-10-04","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":"2107.01595","title":"Learning in nonatomic games, Part I: Finite action spaces and population games","created":"2021-07-04","cited_by_count":7,"area":null},{"id":"2201.12224","title":"Learning Stationary Nash Equilibrium Policies in $n$-Player Stochastic Games with Independent Chains","created":"2022-01-28","cited_by_count":7,"area":null},{"id":"2306.16502","title":"Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements","created":"2023-06-28","cited_by_count":6,"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":"2205.03202","title":"Perseus: A Simple and Optimal High-Order Method for Variational Inequalities","created":"2022-05-06","cited_by_count":5,"area":null},{"id":"2501.08263","title":"Multiplayer Federated Learning: Reaching Equilibrium with Less Communication","created":"2025-01-14","cited_by_count":5,"area":null},{"id":"2502.18605","title":"Expected Variational Inequalities","created":"2025-02-25","cited_by_count":5,"area":null},{"id":"2107.08011","title":"Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements","created":"2021-07-16","cited_by_count":4,"area":null},{"id":"2209.07618","title":"Differentiable Bilevel Programming for Stackelberg Congestion Games","created":"2022-09-15","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":"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":"2407.00575","title":"Learning to Control Unknown Strongly Monotone Games","created":"2024-06-30","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":"2107.02919","title":"Distributed stochastic optimization with large delays","created":"2021-07-06","cited_by_count":3,"area":null},{"id":"2312.16609","title":"Exploiting hidden structures in non-convex games for convergence to Nash equilibrium","created":"2023-12-27","cited_by_count":3,"area":null},{"id":"2402.07588","title":"Understanding Model Selection For Learning In Strategic Environments","created":"2024-02-12","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":"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":"2311.02423","title":"Payoff-based learning with matrix multiplicative weights in quantum games","created":"2023-11-04","cited_by_count":2,"area":null},{"id":"2407.21294","title":"Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach","created":"2024-07-31","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":"2506.13286","title":"The impact of uncertainty on regularized learning in games","created":"2025-06-16","cited_by_count":2,"area":null},{"id":"2101.11946","title":"Equilibrium Learning in Combinatorial Auctions: Computing Approximate Bayesian Nash Equilibria via Pseudogradient Dynamics","created":"2021-01-28","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":"2203.12948","title":"Personalized incentives as feedback design in generalized Nash equilibrium problems","created":"2022-03-24","cited_by_count":1,"area":null},{"id":"2211.15936","title":"Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks","created":"2022-11-29","cited_by_count":1,"area":null},{"id":"2301.08015","title":"Global Nash Equilibrium in Non-convex Multi-player Game: Theory and Algorithms","created":"2023-01-19","cited_by_count":1,"area":null},{"id":"2301.08830","title":"ApproxED: Approximate exploitability descent via learned best responses","created":"2023-01-20","cited_by_count":1,"area":null},{"id":"2312.01587","title":"Scalable and Independent Learning of Nash Equilibrium Policies in $n$-Player Stochastic Games with Unknown Independent Chains","created":"2023-12-04","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":"2503.10186","title":"Convergence and Connectivity: Dynamics of Multi-Agent Q-Learning in Random Networks","created":"2025-03-13","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.07901","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","created":"2025-09-09","cited_by_count":1,"area":null},{"id":"2604.10373","title":"Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD","created":"2026-04-11","cited_by_count":1,"area":null},{"id":"2111.05486","title":"Uncoupled Bandit Learning towards Rationalizability: Benchmarks, Barriers, and Algorithms","created":"2021-11-10","cited_by_count":0,"area":null},{"id":"2201.01450","title":"Offsetting Unequal Competition through RL-assisted Incentive Schemes","created":"2022-01-05","cited_by_count":0,"area":null},{"id":"2211.08043","title":"The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness","created":"2022-11-15","cited_by_count":0,"area":null},{"id":"2307.13922","title":"Stability of Multi-Agent Learning: Convergence in Network Games with Many Players","created":"2023-07-26","cited_by_count":0,"area":null},{"id":"2407.17815","title":"Nested replicator dynamics, nested logit choice, and similarity-based learning","created":"2024-07-25","cited_by_count":0,"area":null},{"id":"2507.03150","title":"Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games","created":"2025-07-03","cited_by_count":0,"area":null},{"id":"2509.21653","title":"A regret minimization approach to fixed-point iterations","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2512.08132","title":"Multi-agent learning under uncertainty: Recurrence vs. concentration","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2512.08138","title":"Robust equilibria in continuous games: From strategic to dynamic robustness","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2604.19065","title":"Last-Iterate Guarantees for Learning in Co-coercive Games","created":"2026-04-21","cited_by_count":0,"area":null},{"id":"2608.09389","title":"Regret, equilibrium, and learning in games: A guided tour","created":"2026-08-10","cited_by_count":0,"area":null},{"id":"2609.15257","title":"Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities","created":"2026-09-14","cited_by_count":0,"area":null},{"id":"2610.01181","title":"Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chains","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.05428","title":"Learning in Continuous Games from Pairwise Preference Feedback","created":"2026-10-04","cited_by_count":0,"area":null},{"id":"2610.14333","title":"Decentralized Bandit Learning of Markov Perfect Equilibria","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}