An Introduction to Counterfactual Regret Minimization

An Introduction to Counterfactual Regret Minimization Todd W. Neller Marc Lanctot . July 9, 2013. 1 Motivation In 2000, Hart and Mas-Colell introduced the important game-theoretic algorithm of Regret matching. Players reach equilibrium play by tracking regrets for past plays, making future plays proportional to positive regrets. The technique is not only simple and intuitive; it has sparked a revolution in computer game play of some of the most difficult bluffing games, including clear domination of annual computer poker competitions. Since the algorithm is relatively recent, there are few curricular materials available to introduce Regret -based algorithms to the next generation of researchers and practitioners in this area. These materials represent a modest first step towards making recent innovations more accessible to advanced Computer Science undergraduates, graduate students, interested researchers, and ambitious practition- ers.

poker competitions. Since the algorithm is relatively recent, there are few curricular materials available to introduce ... we introduce some fundamental terminology and de nitions from game theory, and consider solution concepts for optimal play. Here, we follow the notation and terminology of [12].

Tags:

  Theory, Kepro, Regret, Counterfactual, Counterfactual regret

Information

Related search queries