Lossless abstraction of imperfect information games

DOI10.1145/1284320.1284324zbMath1314.91025OpenAlexW2086312499MaRDI QIDQ3546346

Andrew Gilpin, Tuomas W. Sandholm

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1284320.1284324

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Noncooperative games (91A10) Games involving graphs (91A43) Games in extensive form (91A18) Dynamic programming (90C39) Multistage and repeated games (91A20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A game model based on multi-attribute aggregation, An abstraction-refinement methodology for reasoning about network games, Approximating maxmin strategies in imperfect recall games using A-loss recall property, New complexity results about Nash equilibria, Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder, Faster algorithms for extensive-form game solving via improved smoothing functions, Effective short-term opponent exploitation in simplified poker, Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games, GameShrink, Perspectives on multiagent learning, World-class interpretable poker