Back to Results
First PageMeta Content
Human behavior / Strategy / Nash equilibrium / Zero–sum game / Strategic dominance / Best response / Correlated equilibrium / Solution concept / Extensive-form game / Game theory / Problem solving / Gaming


An Introduction to Counterfactual Regret Minimization Todd W. Neller∗ Marc Lanctot† July 9, 2013
Add to Reading List

Document Date: 2013-07-10 13:27:15

Open Document

File Size: 613,57 KB

Share Result on Facebook

City

Gettysburg / /

/

Event

Product Issues / Product Recall / /

Facility

Maastricht University / Gettysburg College / Campus Box / /

IndustryTerm

expected utilities / respective action utilities / algorithm computing strategy / regret-matching algorithm / exercise computing optimal play / counterfactual regret minimization algorithm / important game-theoretic algorithm / important solutions / /

Organization

Department of Computer Science / Department of Knowledge Engineering / Maastricht University / Gettysburg College / /

Person

Harold E. Kuhn / Gary Monica / Blotto Colonel / Todd W. Neller∗ Marc Lanctot / Blotto Colonel Blotto / /

/

Position

dummy player / Colonel / winning commander / current player / cards player / losing player / legal player / passing forward / player player player player player / single player / commander / active player / row player / player / Sequential Actions Player / general / and permits important solutions / column player / /

Product

abstraction / /

ProgrammingLanguage

Java / C++ / /

ProvinceOrState

Pennsylvania / /

SportsGame

football / /

Technology

counterfactual regret minimization algorithm / regret-based algorithms / regret-matching algorithm / 1 chip / Java / important game-theoretic algorithm / training algorithm / /

SocialTag