{"total":23,"rows":[{"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":"2104.01520","title":"Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium","created":"2021-04-04","cited_by_count":22,"area":null},{"id":"2106.09435","title":"Multi-Agent Training beyond Zero-Sum with Correlated Equilibrium Meta-Solvers","created":"2021-06-17","cited_by_count":21,"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":"2205.15294","title":"Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent","created":"2022-05-30","cited_by_count":15,"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":"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":"2110.04961","title":"Equivalence Analysis between Counterfactual Regret Minimization and Online Mirror Descent","created":"2021-10-11","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":"2302.00797","title":"Combining Tree-Search, Generative Models, and Nash Bargaining Concepts in Game-Theoretic Reinforcement Learning","created":"2023-02-01","cited_by_count":6,"area":null},{"id":"2203.07181","title":"Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation","created":"2022-03-14","cited_by_count":5,"area":null},{"id":"2401.05133","title":"Neural Population Learning beyond Symmetric Zero-sum Games","created":"2024-01-10","cited_by_count":4,"area":null},{"id":"2602.16928","title":"Discovering Multiagent Learning Algorithms with Large Language Models","created":"2026-02-18","cited_by_count":4,"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":"2210.02205","title":"Game Theoretic Rating in N-player general-sum games with Equilibria","created":"2022-10-05","cited_by_count":3,"area":null},{"id":"2310.11518","title":"Guarantees for Self-Play in Multiplayer Games via Polymatrix Decomposability","created":"2023-10-17","cited_by_count":3,"area":null},{"id":"2605.14277","title":"Parallelizing Counterfactual Regret Minimization","created":"2026-05-14","cited_by_count":2,"area":null},{"id":"2410.05496","title":"Intuitions of Compromise: Utilitarianism vs. Contractualism","created":"2024-10-07","cited_by_count":1,"area":null},{"id":"2511.08174","title":"Deep (Predictive) Discounted Counterfactual Regret Minimization","created":"2025-11-11","cited_by_count":1,"area":null},{"id":"2205.12031","title":"Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games: Corrections","created":"2022-05-24","cited_by_count":0,"area":null},{"id":"2212.14317","title":"Safe Subgame Resolving for Extensive Form Correlated Equilibrium","created":"2022-12-29","cited_by_count":0,"area":null},{"id":"2410.14592","title":"Contractivity and linear convergence in bilinear saddle-point problems: An operator-theoretic approach","created":"2024-10-18","cited_by_count":0,"area":null},{"id":"2412.16934","title":"Efficiently Solving Turn-Taking Stochastic Games with Extensive-Form Correlation","created":"2024-12-22","cited_by_count":0,"area":null}],"next_cursor":null}