The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464)
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: The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game |
scientific article; zbMATH DE number 7314601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game |
scientific article; zbMATH DE number 7314601 |
Statements
The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (English)
0 references
23 February 2021
0 references
extensive form game
0 references
perfect equilibrium
0 references
quasi-perfect equilibrium
0 references
algorithms
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0.8520329594612122
0 references
0.8380284309387207
0 references
0.8334450125694275
0 references
0.8318208456039429
0 references
