{"total":68,"rows":[{"id":"2106.06135","title":"DouZero: Mastering DouDizhu with Self-Play Deep Reinforcement Learning","created":"2021-06-11","cited_by_count":66,"area":null},{"id":"2110.02924","title":"No-Press Diplomacy from Scratch","created":"2021-10-06","cited_by_count":31,"area":null},{"id":"2106.14326","title":"Last-iterate Convergence in Extensive-Form Games","created":"2021-06-27","cited_by_count":28,"area":null},{"id":"2408.01072","title":"A Survey on Self-play Methods in Reinforcement Learning","created":"2024-08-02","cited_by_count":26,"area":"deeprl"},{"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":"2206.09495","title":"The Power of Regularization in Solving Extensive-Form Games","created":"2022-06-19","cited_by_count":21,"area":null},{"id":"2401.06781","title":"PokerGPT: An End-to-End Lightweight Solver for Multi-Player Texas Hold'em via Large Language Model","created":"2024-01-04","cited_by_count":20,"area":null},{"id":"2102.08903","title":"Provably Efficient Policy Optimization for Two-Player Zero-Sum Markov Games","created":"2021-02-17","cited_by_count":18,"area":null},{"id":"2103.04546","title":"Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games","created":"2021-03-08","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":"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":"2502.08938","title":"Reevaluating Policy Gradient Methods for Imperfect-Information Games","created":"2025-02-13","cited_by_count":13,"area":"deeprl"},{"id":"2103.04539","title":"Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games","created":"2021-03-08","cited_by_count":12,"area":null},{"id":"2402.02720","title":"Discounted Adaptive Online Learning: Towards Better Regularization","created":"2024-02-05","cited_by_count":12,"area":null},{"id":"2403.04344","title":"RL-CFR: Improving Action Abstraction for Imperfect Information Extensive-Form Games with Reinforcement Learning","created":"2024-03-07","cited_by_count":10,"area":"deeprl"},{"id":"2201.07700","title":"Anytime PSRO for Two-Player Zero-Sum Games","created":"2022-01-19","cited_by_count":9,"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":"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":"2605.19928","title":"Real-Time Parallel Counterfactual Regret Minimization","created":"2026-05-19","cited_by_count":6,"area":null},{"id":"2408.00751","title":"A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence","created":"2024-08-01","cited_by_count":5,"area":"deeprl"},{"id":"2605.30094","title":"PokerSkill: LLMs Can Play Expert-Level Poker without Training or Solvers","created":"2026-05-28","cited_by_count":5,"area":null},{"id":"2105.08440","title":"CFR-MIX: Solving Imperfect Information Extensive-Form Games with Combinatorial Action Space","created":"2021-05-18","cited_by_count":4,"area":null},{"id":"2201.10377","title":"Public Information Representation for Adversarial Team Games","created":"2022-01-25","cited_by_count":4,"area":null},{"id":"2202.12277","title":"Solving optimization problems with Blackwell approachability","created":"2022-02-24","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":"2607.28520","title":"Agents That Certify Their Own Exploits: Confidence-Scheduled Restricted Responses for Safe Opponent Exploitation","created":"2026-07-30","cited_by_count":4,"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":"2407.20351","title":"LiteEFG: An Efficient Python Library for Solving Extensive-form Games","created":"2024-07-29","cited_by_count":3,"area":null},{"id":"2510.04407","title":"Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games","created":"2025-10-06","cited_by_count":3,"area":null},{"id":"2207.05285","title":"Offline Equilibrium Finding","created":"2022-07-12","cited_by_count":2,"area":"offlinerl"},{"id":"2303.01074","title":"Learning not to Regret","created":"2023-03-02","cited_by_count":2,"area":null},{"id":"2402.19420","title":"Understanding Iterative Combinatorial Auction Designs via Multi-Agent Reinforcement Learning","created":"2024-02-29","cited_by_count":2,"area":null},{"id":"2410.23398","title":"On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games","created":"2024-10-30","cited_by_count":2,"area":null},{"id":"2505.19491","title":"Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2510.17067","title":"Convergence of Regret Matching in Potential Games and Constrained Optimization","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2605.14277","title":"Parallelizing Counterfactual Regret Minimization","created":"2026-05-14","cited_by_count":2,"area":null},{"id":"2608.06741","title":"Solver-Guided Reasoning for Mixed-Equilibrium Strategies","created":"2026-08-07","cited_by_count":2,"area":"lr"},{"id":"2203.05920","title":"Generalized Bandit Regret Minimizer Framework in Imperfect Information Extensive-Form Game","created":"2022-03-11","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":"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":"2503.12770","title":"Faster Game Solving via Asymmetry of Step Sizes","created":"2025-03-17","cited_by_count":1,"area":null},{"id":"2504.18868","title":"Approximating Nash Equilibria in General-Sum Games via Meta-Learning","created":"2025-04-26","cited_by_count":1,"area":null},{"id":"2508.06559","title":"Solving Pasur Using GPU-Accelerated Counterfactual Regret Minimization","created":"2025-08-06","cited_by_count":1,"area":null},{"id":"2510.15094","title":"Beyond Outcome-Based Imperfect-Recall: Higher-Resolution Abstractions for Imperfect-Information Games","created":"2025-10-16","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":"2511.13186","title":"DiffFP: Learning Behaviors from Scratch via Diffusion-based Fictitious Play","created":"2025-11-17","cited_by_count":1,"area":"deeprl"},{"id":"2608.06362","title":"AV-AIVAT: 74x Cheaper Agent Evaluation with Certified Anytime-Valid Stopping in Imperfect-Information Games","created":"2026-08-06","cited_by_count":1,"area":"agents"},{"id":"2102.07495","title":"ScrofaZero: Mastering Trick-taking Poker Game Gongzhu by Deep Reinforcement Learning","created":"2021-02-15","cited_by_count":0,"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":"2112.10890","title":"Revisiting Game Representations: The Hidden Costs of Efficiency in Sequential Decision-making Algorithms","created":"2021-12-20","cited_by_count":0,"area":null},{"id":"2201.11580","title":"DecisionHoldem: Safe Depth-Limited Solving With Diverse Opponents for Imperfect-Information Games","created":"2022-01-27","cited_by_count":0,"area":null},{"id":"2302.14208","title":"Methods and Mechanisms for Interactive Novelty Handling in Adversarial Environments","created":"2023-02-28","cited_by_count":0,"area":null},{"id":"2308.08693","title":"AI planning in the imagination: High-level planning on learned abstract search spaces","created":"2023-08-16","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":"2309.03084","title":"Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play","created":"2023-09-04","cited_by_count":0,"area":null},{"id":"2402.11835","title":"Easy as ABCs: Unifying Boltzmann Q-Learning and Counterfactual Regret Minimization","created":"2024-02-19","cited_by_count":0,"area":"deeprl"},{"id":"2408.14778","title":"GPU-Accelerated Counterfactual Regret Minimization","created":"2024-08-27","cited_by_count":0,"area":null},{"id":"2411.01720","title":"Barriers to Welfare Maximization with No-Regret Learning","created":"2024-11-04","cited_by_count":0,"area":null},{"id":"2504.18917","title":"Meta-Learning in Self-Play Regret Minimization","created":"2025-04-26","cited_by_count":0,"area":null},{"id":"2509.13653","title":"Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation","created":"2025-09-17","cited_by_count":0,"area":null},{"id":"2509.23747","title":"Beyond Game Theory Optimal: Profit-Maximizing Poker Agents for No-Limit Holdem","created":"2025-09-28","cited_by_count":0,"area":null},{"id":"2510.11877","title":"Robust Adversarial Reinforcement Learning in Stochastic Games via Sequence Modeling","created":"2025-10-13","cited_by_count":0,"area":"offlinerl"},{"id":"2510.25080","title":"Monopoly Deal: A Benchmark Environment for Bounded One-Sided Response Games","created":"2025-10-29","cited_by_count":0,"area":null},{"id":"2511.12083","title":"No-Regret Strategy Solving in Imperfect-Information Games via Pre-Trained Embedding","created":"2025-11-15","cited_by_count":0,"area":null},{"id":"2607.25835","title":"Distributed Constraint Optimization via Online Learning and Iterative Pricing with Application to Large-Scale Satellite Scheduling","created":"2026-07-28","cited_by_count":0,"area":null},{"id":"2608.29197","title":"PokaiTrainer: Scaling Equilibrium Search to Competitive Pok\\'emon VGC","created":"2026-08-29","cited_by_count":0,"area":null},{"id":"2609.11923","title":"GPU-CFR: 80x Faster Counterfactual Regret Minimization by Compiling the Game to Static Dataflow and CUDA Graph Replay","created":"2026-09-10","cited_by_count":0,"area":null}],"next_cursor":null}