The following pages link to GameShrink (Q24438):
Displaying 10 items.
- New complexity results about Nash equilibria (Q932810) (← links)
- Effective short-term opponent exploitation in simplified poker (Q1009317) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- Approximating maxmin strategies in imperfect recall games using A-loss recall property (Q1726399) (← links)
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder (Q1761280) (← links)
- World-class interpretable poker (Q2102358) (← links)
- Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
- Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games (Q2307334) (← links)
- A game model based on multi-attribute aggregation (Q3168946) (← links)
- Smoothing Techniques for Computing Nash Equilibria of Sequential Games (Q3169104) (← links)
