812 citations · 855 across the 10 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2013★ 13 cited
Measuring the Size of Large No-Limit Poker Games
Michael Johanson
In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the nu…
cs.GT2013★ 7 cited
Solving Imperfect Information Games Using Decomposition
Neil Burch, Michael Johanson, Michael Bowling
Decomposition, i.e. independently analyzing possible subgames, has proven to be an essential principle for effective decision-making in perfect information games. However, in imper…