Loading...
Please wait, while we are loading the content...
Similar Documents
On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games
| Content Provider | CiteSeerX |
|---|---|
| Author | Štefankovič, Daniel |
| Abstract | The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an important open question. We put forward the notion of (0, 1)-bimatrix games, and show that some associated computational problems are as hard as in the general case. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Bimatrix Game Associated Computational Problem Nash Equilibrium General Case Nonzero Sum Bimatrix Game Important Open Question Computational Complexity |
| Content Type | Text |