Bimatrix games have quasi-strict equilibria

Bimatrix games have quasi-strict equilibria

0.00 Avg rating0 Votes
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:
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.