Bimatrix games have quasi-strict equilibria -- Web of Science 5.0

Easy Search Results--Full Record

Article 13 of 40

Explanation

Bimatrix games have quasi-strict equilibria
Norde H
MATHEMATICAL PROGRAMMING 85 (1): 35-49 MAY 1999

Document type: Article

Language: English

Cited References: 12

Times Cited: 0

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.

Author Keywords:
bimatrix game, quasi-strict equilibrium

Addresses:
Norde H, Tilburg Univ, Dept Econometr, Postbus 90153, NL-5000 LE Tilburg, Netherlands
Tilburg Univ, Dept Econometr, NL-5000 LE Tilburg, Netherlands

Publisher:
ELSEVIER SCIENCE BV, AMSTERDAM

IDS Number:
221AW

ISSN:
0025-5610

Article 13 of 40

Acceptable Use Policy