CFR-D: Solving Imperfect Information Games Using Decomposition
by: Neil Burch, Michael Bowling
Abstract
One of the significant advantages in problems with perfect information, like search or games like checkers, is that they can be decomposed into independent pieces. In contrast, problems with imperfect information, like market modeling or games like poker, are treated as a single decomposable whole. Handling the game as a single unit places a much stricter limit on the size of solvable imperfect information games. This paper has two main contributions. First, we introduce CFR-D, a new variant of the counterfactual regret minimising family of algorithms. For any problem which can be decomposed into a trunk and subproblems, CFR-D can handle the trunk and each subproblem independently. Decomposition lets CFR-D have memory requirements which are sub-linear in the number of decision points, a desirable property more commonly associated with perfect information algorithms. Second, we present an algorithm for recovering an equilibrium strategy in a subproblem given the trunk strategy and some summary information about the subproblem.
http://arxiv.org/pdf/1303.4441v1.pdfStatistics: Posted by pumpkinpuree — Sun Mar 31, 2013 2:57 pm
]]>