{"total":20,"rows":[{"id":"2306.09983","title":"Evaluating Superhuman Models with Consistency Checks","created":"2023-06-16","cited_by_count":47,"area":null},{"id":"2308.09175","title":"Diversifying AI: Towards Creative Chess with AlphaZero","created":"2023-08-17","cited_by_count":15,"area":null},{"id":"2208.09855","title":"Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games","created":"2022-08-21","cited_by_count":9,"area":null},{"id":"2111.05884","title":"Search in Imperfect Information Games","created":"2021-11-10","cited_by_count":8,"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":"2303.03196","title":"Population-based Evaluation in Repeated Rock-Paper-Scissors as a Benchmark for Multiagent Reinforcement Learning","created":"2023-03-02","cited_by_count":5,"area":null},{"id":"2312.13435","title":"The Adaptive Arms Race: Redefining Robustness in AI Security","created":"2023-12-20","cited_by_count":5,"area":null},{"id":"2401.13460","title":"Multi-Agent Diagnostics for Robustness via Illuminated Diversity","created":"2024-01-24","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":"2206.00113","title":"BRExIt: On Opponent Modelling in Expert Iteration","created":"2022-05-31","cited_by_count":2,"area":null},{"id":"2308.04719","title":"JiangJun: Mastering Xiangqi by Tackling Non-Transitivity in Two-Player Zero-Sum Games","created":"2023-08-09","cited_by_count":2,"area":null},{"id":"2601.22896","title":"Game-Theoretic Co-Evolution for LLM-Based Heuristic Discovery","created":"2026-01-30","cited_by_count":2,"area":null},{"id":"2211.15936","title":"Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks","created":"2022-11-29","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":"2404.16689","title":"Learning to Beat ByteRL: Exploitability of Collectible Card Game Agents","created":"2024-04-25","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":"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":"2306.06067","title":"Combining a Meta-Policy and Monte-Carlo Planning for Scalable Type-Based Reasoning in Partially Observable Environments","created":"2023-06-09","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":"2607.11486","title":"Communicating Chess Strategies in Natural Language","created":"2026-07-13","cited_by_count":0,"area":null}],"next_cursor":null}