{"total":20,"rows":[{"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":"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.02274","title":"Neural Recursive Belief States in Multi-Agent Reinforcement Learning","created":"2021-02-03","cited_by_count":18,"area":null},{"id":"2403.02227","title":"Policy Space Response Oracles: A Survey","created":"2024-03-04","cited_by_count":10,"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.19928","title":"Real-Time Parallel Counterfactual Regret Minimization","created":"2026-05-19","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":"2207.07971","title":"A Survey of Decision Making in Adversarial Games","created":"2022-07-16","cited_by_count":3,"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":"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":"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":"2406.08687","title":"AlphaZeroES: Direct score maximization outperforms planning loss minimization","created":"2024-06-12","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}