arxiv
PublishedJuly 21, 2026 at 4:00 AM
Computing Evolutionarily Stable Strategies in Imperfect-Information Games
Publisher summary· verbatim
arXiv:2512.10279v5 Announce Type: replace-cross Abstract: We present an algorithm for computing evolutionarily stable strategies (ESSs) in symmetric perfect-recall extensive-form games of imperfect information. Our main algorithm is for two-player games, and we describe how it can be extended to mul
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivCapacity and Redundancy Trade-offs in Multi-Task Learning12harxivPredictive Training with Latent Imagination for Visual Quadruped Navigation12harxivWhere Not to Learn: Prior-Aligned Training with Subset-based Attribution Constraints for Reliable Decision-Making12harxivDid We Actually Fix It? An Independent Adversarial Stress-Test of Post-Point-Adjustment Evaluation Metrics for Time-Series Anomaly Detection12hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗