Cited in
(13)- Approximating maxmin strategies in imperfect recall games using A-loss recall property
- World-class interpretable poker
- An abstraction-refinement methodology for reasoning about network games
- New complexity results about Nash equilibria
- Effective short-term opponent exploitation in simplified poker
- Radish
- DeepStack
- Libratus
- Smoothing techniques for computing Nash equilibria of sequential games
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- A game model based on multi-attribute aggregation
- Faster algorithms for extensive-form game solving via improved smoothing functions
- Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games
This page was built for software: GameShrink
