{"total":18,"rows":[{"id":"2402.12284","title":"Refining Minimax Regret for Unsupervised Environment Design","created":"2024-02-19","cited_by_count":18,"area":"deeprl"},{"id":"2502.08938","title":"Reevaluating Policy Gradient Methods for Imperfect-Information Games","created":"2025-02-13","cited_by_count":13,"area":"deeprl"},{"id":"2511.07312","title":"Scalable Decision Making for Games of Imperfect Information","created":"2025-11-10","cited_by_count":8,"area":"deeprl"},{"id":"2507.11019","title":"Relative Entropy Pathwise Policy Optimization","created":"2025-07-15","cited_by_count":7,"area":"deeprl"},{"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":"2406.14156","title":"Tractable Equilibrium Computation in Markov Games through Risk Aversion","created":"2024-06-20","cited_by_count":4,"area":"deeprl"},{"id":"2504.03743","title":"Modelling bounded rational decision-making through Wasserstein constraints","created":"2025-04-01","cited_by_count":2,"area":"deeprl"},{"id":"2508.08669","title":"Convergent Q-Learning for Infinite-Horizon General-Sum Markov Games through Behavioral Economics","created":"2025-08-12","cited_by_count":2,"area":"deeprl"},{"id":"2510.18183","title":"NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria","created":"2025-10-21","cited_by_count":2,"area":"deeprl"},{"id":"2602.10894","title":"Revisiting Regularized Policy Optimization for Stable and Efficient Reinforcement Learning in Two-Player Games","created":"2026-02-11","cited_by_count":1,"area":"deeprl"},{"id":"2605.14379","title":"Data-Augmented Game Starts for Accelerating Self-Play Exploration in Imperfect Information Games","created":"2026-05-14","cited_by_count":1,"area":"deeprl"},{"id":"2606.23995","title":"EMAgnet: Parameter-Space EMA Regularization for Policy Gradient Self-Play in Large Games","created":"2026-06-22","cited_by_count":1,"area":"deeprl"},{"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":"2511.03724","title":"Outbidding and Outbluffing Elite Humans: Mastering Liar's Poker via Self-Play and Reinforcement Learning","created":"2025-11-05","cited_by_count":0,"area":"deeprl"},{"id":"2605.19235","title":"GAE Falls Short in Imperfect-Information Self-Play Reinforcement Learning","created":"2026-05-19","cited_by_count":0,"area":"deeprl"},{"id":"2606.23348","title":"Superhuman AI for Generals.io Using Self-Play Reinforcement Learning","created":"2026-06-22","cited_by_count":0,"area":"deeprl"},{"id":"2608.05422","title":"IFlowNets: Extending Generative Samplers to Learn Strategies in Incomplete Information Games","created":"2026-08-05","cited_by_count":0,"area":"deeprl"},{"id":"2609.01549","title":"NashDreamer: Model-Based Reinforcement Learning for Zero-Sum Imperfect-Information Games","created":"2026-09-01","cited_by_count":0,"area":"deeprl"}],"next_cursor":null}