A note on the complexity of determining optimal strategies in games with common payoffs (Q1416783)
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: A note on the complexity of determining optimal strategies in games with common payoffs |
scientific article; zbMATH DE number 2018323
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of determining optimal strategies in games with common payoffs |
scientific article; zbMATH DE number 2018323 |
Statements
A note on the complexity of determining optimal strategies in games with common payoffs (English)
0 references
16 December 2003
0 references
Games
0 references
computational complexity
0 references
common payoffs
0 references
0.96172726
0 references
0.8949048
0 references
0 references
0.89282376
0 references
0.8900147
0 references
0.88980335
0 references
0.88320374
0 references
