Article ID: | iaor20001696 |
Country: | Germany |
Volume: | 85 |
Issue: | 1 |
Start Page Number: | 35 |
End Page Number: | 49 |
Publication Date: | Jan 1999 |
Journal: | Mathematical Programming |
Authors: | Norde H. |
In this paper we show that every bimatrix game has at least one quasi-strict equilibrium, i.e. a Nash-equilibrium with the property that every player assigns positive probability to each of his pure best replies.