On the complexity of constrained Nash equilibria in graphical games (Q837182)
From MaRDI portal
!
WARNING
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 5602749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of constrained Nash equilibria in graphical games |
scientific article; zbMATH DE number 5602749 |
Statements
On the complexity of constrained Nash equilibria in graphical games (English)
0 references
10 September 2009
0 references
game theory
0 references
graphical games
0 references
Nash equilibria
0 references
computational complexity
0 references
treewidth
0 references
0.8521830439567566
0 references
0.8460368514060974
0 references
0.837095320224762
0 references
0.8322334885597229
0 references
