SearchSkip to Search Results
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. While the base algorithm performs a full tree traversal on each iteration, Monte Carlo CFR (MCCFR) reduces the per...
This manual describes PSVN, a language for describing state space search problems using multi-valued variables that lends itself to efficient calculation of state's successors and predecessors without having to fully ground the operators. It also describes the PSVN compiler, psvn2c, which accepts...
Decision-making problems with two agents can be modeled as two player games, and a Nash equilibrium is the basic solution concept describing good play in adversarial games. Computing this equilibrium solution for imperfect information games, where players have private, hidden information, is...