Algorithms for computing strategies in two-player simultaneous move games (Q286381)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for computing strategies in two-player simultaneous move games |
scientific article; zbMATH DE number 6583257
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for computing strategies in two-player simultaneous move games |
scientific article; zbMATH DE number 6583257 |
Statements
Algorithms for computing strategies in two-player simultaneous move games (English)
0 references
20 May 2016
0 references
simultaneous move games
0 references
Markov games
0 references
backward induction
0 references
Monte Carlo tree search
0 references
alpha-beta pruning
0 references
double-oracle algorithm
0 references
regret matching
0 references
counterfactual regret minimization
0 references
game playing
0 references
Nash equilibrium
0 references
0 references
0 references
