The computational complexity of finding a mixed Berge equilibrium for a \(k\)-person noncooperative game in normal form (Q4557743)
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 6984971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of finding a mixed Berge equilibrium for a \(k\)-person noncooperative game in normal form |
scientific article; zbMATH DE number 6984971 |
Statements
The Computational Complexity of Finding a Mixed Berge Equilibrium for a k-Person Noncooperative Game in Normal Form (English)
0 references
26 November 2018
0 references
mixed Berge equilibrium
0 references
computational complexity
0 references
NP-complete
0 references
0 references
0.7952119708061218
0 references
0.7936753630638123
0 references
0.7912078499794006
0 references
0.7822763323783875
0 references
0.7821510434150696
0 references
