Regret Minimization in Games with Incomplete Information

Extensive games are a powerful model of multiagent decision-making scenarios with incomplete information. Finding a Nash equilibrium for very large instances of these games has received a great deal of recent attention. In this paper, we describe a new technique for solving large games based on regret minimization. In particular, we introduce the notion of counterfactual regret, which exploits the degree of incomplete information in an extensive game. We show how minimizing counterfactual regret minimizes overall regret, and therefore in self-play can be used to compute a Nash equilibrium. We demonstrate this technique in the domain , showing we can solve abstractions of limit Texas Hold’em with as many as 1012 states, two orders of magnitude larger than previous methods.

• Type: Conference
• Year: 2007
• Where: NIPS
• Authors: Martin Zinkevich, Michael Johanson, Michael H. Bowling, Carmelo Piccione
• Keywords: Counterfactual Regret, Extensive Game, Information Technology, Nash Equilibrium, NIPS 2007