{"total":32,"rows":[{"id":"2103.03104","title":"Learning to run a Power Network Challenge: a Retrospective Analysis","created":"2021-03-02","cited_by_count":55,"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":"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":"2101.04237","title":"Solving Common-Payoff Games with Approximate Policy Iteration","created":"2021-01-11","cited_by_count":15,"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":"2206.09161","title":"A Marriage between Adversarial Team Games and 2-player Games: Enabling Abstractions, No-regret Learning, and Subgame Solving","created":"2022-06-18","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":"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.30094","title":"PokerSkill: LLMs Can Play Expert-Level Poker without Training or Solvers","created":"2026-05-28","cited_by_count":5,"area":null},{"id":"2305.17327","title":"Hierarchical Deep Counterfactual Regret Minimization","created":"2023-05-27","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":"2102.01775","title":"Safe Search for Stackelberg Equilibria in Extensive-Form Games","created":"2021-02-02","cited_by_count":3,"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":"2304.13138","title":"The Update-Equivalence Framework for Decision-Time Planning","created":"2023-04-25","cited_by_count":3,"area":null},{"id":"2603.23660","title":"GTO Wizard Benchmark","created":"2026-03-24","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":"2105.12328","title":"D2CFR: Minimize Counterfactual Regret with Deep Dueling Neural Network","created":"2021-05-26","cited_by_count":1,"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":"2203.07562","title":"Safe adaptation in multiagent competition","created":"2022-03-14","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":"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":"2105.09719","title":"Towards a Sample Efficient Reinforcement Learning Pipeline for Vision Based Robotics","created":"2021-05-20","cited_by_count":0,"area":null},{"id":"2108.06832","title":"A Fast Algorithm for Computing the Deficiency Number of a Mahjong Hand","created":"2021-08-15","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":"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":"2602.00676","title":"OpenGuanDan: A Large-Scale Imperfect Information Game Benchmark","created":"2026-01-31","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},{"id":"2609.33669","title":"RSD-Poker: Structure-Adaptive and Shift-Robust Risk-Utility Certification for Residual Policies in Imperfect-Information Games","created":"2026-09-27","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}