{"total":24,"rows":[{"id":"2106.14326","title":"Last-iterate Convergence in Extensive-Form Games","created":"2021-06-27","cited_by_count":28,"area":null},{"id":"2206.04122","title":"ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret","created":"2022-06-08","cited_by_count":24,"area":null},{"id":"2112.03178","title":"Student of Games: A unified learning algorithm for both perfect and imperfect information games","created":"2021-12-06","cited_by_count":23,"area":null},{"id":"2210.14640","title":"HSVI can solve zero-sum Partially Observable Stochastic Games","created":"2022-10-26","cited_by_count":8,"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":"2301.09159","title":"Abstracting Imperfect Information Away from Two-Player Zero-Sum Games","created":"2023-01-22","cited_by_count":6,"area":null},{"id":"2506.01242","title":"General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chess","created":"2025-06-02","cited_by_count":6,"area":null},{"id":"2605.19928","title":"Real-Time Parallel Counterfactual Regret Minimization","created":"2026-05-19","cited_by_count":6,"area":null},{"id":"2102.01775","title":"Safe Search for Stackelberg Equilibria in Extensive-Form Games","created":"2021-02-02","cited_by_count":3,"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":"2310.04796","title":"Accelerate Multi-Agent Reinforcement Learning in Zero-Sum Games with Subgame Curriculum Learning","created":"2023-10-07","cited_by_count":2,"area":null},{"id":"2501.10464","title":"Adapting Beyond the Depth Limit: Counter Strategies in Large Imperfect Information Games","created":"2025-01-15","cited_by_count":2,"area":null},{"id":"2111.07631","title":"AI in Human-computer Gaming: Techniques, Challenges and Opportunities","created":"2021-11-15","cited_by_count":1,"area":null},{"id":"2307.12087","title":"CFR-p: Counterfactual Regret Minimization with Hierarchical Policy Abstraction, and its Application to Two-player Mahjong","created":"2023-07-22","cited_by_count":1,"area":null},{"id":"2507.19263","title":"Modeling Uncertainty: Constraint-Based Belief States in Imperfect-Information Games","created":"2025-07-25","cited_by_count":1,"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":"2307.12062","title":"Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations","created":"2023-07-22","cited_by_count":0,"area":null},{"id":"2404.10679","title":"HSVI-based Online Minimax Strategies for Partially Observable Stochastic Games with Neural Perception Mechanisms","created":"2024-04-16","cited_by_count":0,"area":null},{"id":"2408.02380","title":"Perfect Information Monte Carlo with Postponing Reasoning","created":"2024-08-05","cited_by_count":0,"area":null},{"id":"2408.14778","title":"GPU-Accelerated Counterfactual Regret Minimization","created":"2024-08-27","cited_by_count":0,"area":null},{"id":"2412.15877","title":"Approximate State Abstraction for Markov Games","created":"2024-12-20","cited_by_count":0,"area":null},{"id":"2602.00676","title":"OpenGuanDan: A Large-Scale Imperfect Information Game Benchmark","created":"2026-01-31","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},{"id":"2610.20473","title":"SafeAdapt-Poker: Counterfactual Risk Calibration for Budgeted Adaptation under Opponent Shift","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}