Title of article
On the computational complexity of Nash equilibria for (0,1) bimatrix games
Author/Authors
Bruno Codenotti، نويسنده , , Daniel ?tefankovi?، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2005
Pages
6
From page
145
To page
150
Keywords
computational complexity , Bimatrix games , Nash equilibrium , NP-Completeness , Imitation games
Journal title
Information Processing Letters
Serial Year
2005
Journal title
Information Processing Letters
Record number
130073
Link To Document