{"total":37,"rows":[{"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":"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":"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":"2207.10170","title":"Illusory Attacks: Information-Theoretic Detectability Matters in Adversarial Attacks","created":"2022-07-20","cited_by_count":12,"area":null},{"id":"2207.06541","title":"Self-Play PSRO: Toward Optimal Populations in Two-Player Zero-Sum Games","created":"2022-07-13","cited_by_count":11,"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":"2303.05197","title":"Mastering Strategy Card Game (Hearthstone) with Improved Techniques","created":"2023-03-09","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":"2305.16610","title":"Adaptively Perturbed Mirror Descent for Learning in Games","created":"2023-05-26","cited_by_count":9,"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":"2305.17342","title":"Rethinking Adversarial Policies: A Generalized Attack Formulation and Provable Defense in RL","created":"2023-05-27","cited_by_count":7,"area":null},{"id":"2301.09159","title":"Abstracting Imperfect Information Away from Two-Player Zero-Sum Games","created":"2023-01-22","cited_by_count":6,"area":null},{"id":"2310.03354","title":"Fictitious Cross-Play: Learning Global Nash Equilibrium in Mixed Cooperative-Competitive Games","created":"2023-10-05","cited_by_count":6,"area":null},{"id":"2302.03439","title":"Ensemble Value Functions for Efficient Exploration in Multi-Agent Reinforcement Learning","created":"2023-02-07","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":"2306.05100","title":"Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates","created":"2023-06-08","cited_by_count":4,"area":null},{"id":"2304.13138","title":"The Update-Equivalence Framework for Decision-Time Planning","created":"2023-04-25","cited_by_count":3,"area":null},{"id":"2309.12226","title":"Smooth Nash Equilibria: Algorithms and Complexity","created":"2023-09-21","cited_by_count":3,"area":null},{"id":"2407.20351","title":"LiteEFG: An Efficient Python Library for Solving Extensive-form Games","created":"2024-07-29","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":"2510.22421","title":"Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems","created":"2025-10-25","cited_by_count":3,"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":"2407.20128","title":"Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games","created":"2024-07-29","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":"2405.11746","title":"Configurable Mirror Descent: Towards a Unification of Decision Making","created":"2024-05-20","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":"2606.29457","title":"How Much Due Diligence Before You Bid? Learning in Intractable Takeover Auctions","created":"2026-06-28","cited_by_count":1,"area":null},{"id":"2607.17543","title":"The Curvature Shadow: An Apparent Failure of Maximum-Entropy Equilibrium Selection is a Removable Artifact","created":"2026-07-20","cited_by_count":1,"area":null},{"id":"2307.12062","title":"Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations","created":"2023-07-22","cited_by_count":0,"area":null},{"id":"2308.11256","title":"Efficient Last-iterate Convergence Algorithms in Solving Games","created":"2023-08-22","cited_by_count":0,"area":null},{"id":"2603.09208","title":"Strategically Robust Multi-Agent Reinforcement Learning with Linear Function Approximation","created":"2026-03-10","cited_by_count":0,"area":null},{"id":"2606.21528","title":"Accelerated and Stable Convergence with Anchored Generalized Optimistic Method","created":"2026-06-19","cited_by_count":0,"area":null},{"id":"2606.22688","title":"GARIP: A Running-Average Moving Reference for Last-Iterate Self-Play in Two-Player Zero-Sum Games","created":"2026-06-21","cited_by_count":0,"area":null},{"id":"2607.06514","title":"FootsiesGym: A Fighting Game Benchmark for Two-Player Zero-Sum Imperfect-Information Games","created":"2026-07-07","cited_by_count":0,"area":null},{"id":"2608.08407","title":"Does a Toehold Make a Bidder Bolder? Preemption and Multiplicity in Multi-Round Takeover Auctions","created":"2026-08-09","cited_by_count":0,"area":null},{"id":"2609.19820","title":"Steering Equilibrium Selection in Regularized Self-Play via the Reference Policy","created":"2026-09-17","cited_by_count":0,"area":null},{"id":"2609.26581","title":"Polyak-Type Extragradient Methods for Monotone Root-Finding Problems","created":"2026-09-22","cited_by_count":0,"area":null}],"next_cursor":null}