The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.geb.2019.03.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3081265119 / rank | |||
Normal rank | |||
Revision as of 21:46, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game |
scientific article |
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
