GameShrink

swMATH12511MaRDI QIDQ24438FDOQ24438

Author name not available (Why is that?)

Described by source

• Lossless abstraction of imperfect information games

Cited In (10)

• 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
• 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
• Smoothing Techniques for Computing Nash Equilibria of Sequential Games

This page was built for software: GameShrink