Equilibria in constrained concave bimatrix games
Wojciech Połowczuk, Tadeusz Radzik (2013)
Applicationes Mathematicae
Similarity:
We study a generalization of bimatrix games in which not all pairs of players' pure strategies are admissible. It is shown that under some additional convexity assumptions such games have equilibria of a very simple structure, consisting of two probability distributions with at most two-element supports. Next this result is used to get a theorem about the existence of Nash equilibria in bimatrix games with a possibility of payoffs equal to -∞. The first of these results is a discrete...