Maximal nash subsets for bimatrix games

M. J. M. Jansen

Naval Research Logistics Quarterly, 1981, vol. 28, issue 1, 147-152

Abstract: In this work maximal Nash subsets are studied in order to show that the set of equilibrium points of a bimatrix game is the finite union of all such subsets. In addition, the extreme points of maximal Nash subsets are characterized in terms of square submatrices of the payoff matrices and dimension relations are derived.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800280111

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:28:y:1981:i:1:p:147-152

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().