Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games (Q2307334)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7183526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games |
scientific article; zbMATH DE number 7183526 |
Statements
Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games (English)
0 references
27 March 2020
0 references
extensive-form games
0 references
information abstraction
0 references
imperfect recall
0 references
Nash equilibrium
0 references
fictitious play
0 references
counterfactual regret minimization
0 references
0 references
0.8512954115867615
0 references
0.8395833373069763
0 references
0.7731022834777832
0 references
0.7643301486968994
0 references
