{"total":28,"rows":[{"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":"2204.03991","title":"The Complexity of Markov Equilibrium in Stochastic Games","created":"2022-04-08","cited_by_count":49,"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":"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":"2310.19647","title":"Fast swap regret minimization and applications to approximate correlated equilibria","created":"2023-10-30","cited_by_count":32,"area":null},{"id":"2302.06606","title":"Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation","created":"2023-02-13","cited_by_count":30,"area":null},{"id":"2208.10458","title":"Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model","created":"2022-08-22","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":"2206.01880","title":"Learning in Congestion Games with Bandit Feedback","created":"2022-06-04","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":"2307.09470","title":"Multi-Player Zero-Sum Markov Games with Networked Separable Interactions","created":"2023-07-13","cited_by_count":10,"area":null},{"id":"2208.02204","title":"Efficiently Computing Nash Equilibria in Adversarial Team Markov Games","created":"2022-08-03","cited_by_count":7,"area":null},{"id":"2502.18605","title":"Expected Variational Inequalities","created":"2025-02-25","cited_by_count":5,"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":"2502.18582","title":"Learning and Computation of $\\Phi$-Equilibria at the Frontier of Tractability","created":"2025-02-25","cited_by_count":4,"area":null},{"id":"2309.12226","title":"Smooth Nash Equilibria: Algorithms and Complexity","created":"2023-09-21","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":"2303.00970","title":"PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium","created":"2023-03-02","cited_by_count":2,"area":null},{"id":"2405.07914","title":"Distribution Learning Meets Graph Structure Sampling","created":"2024-05-13","cited_by_count":1,"area":null},{"id":"2501.10884","title":"Fixed Point Computation: Beating Brute Force with Smoothed Analysis","created":"2025-01-18","cited_by_count":1,"area":null},{"id":"2508.11874","title":"Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models","created":"2025-08-16","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":"2606.17000","title":"The Complexity of Min-Max Optimization for Quadratic Polynomials","created":"2026-06-15","cited_by_count":1,"area":null},{"id":"2609.22757","title":"Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria","created":"2026-09-19","cited_by_count":1,"area":null},{"id":"2210.16506","title":"Observable Perfect Equilibrium","created":"2022-10-29","cited_by_count":0,"area":null},{"id":"2310.08066","title":"The Search-and-Mix Paradigm in Approximate Nash Equilibrium Algorithms","created":"2023-10-12","cited_by_count":0,"area":null},{"id":"2411.01721","title":"Computational Lower Bounds for Regret Minimization in Normal-Form Games","created":"2024-11-04","cited_by_count":0,"area":null},{"id":"2507.10567","title":"Protocols for Verifying Smooth Strategies in Bandits and Games","created":"2025-07-08","cited_by_count":0,"area":null}],"next_cursor":null}