Maximal nash subsets for bimatrix games
β Scribed by M. J. M. Jansen
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 351 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, it is shown that the structure of the set of Pareto equilibria for & bimatrix game resembles the structure of the set of (perfect) Nash equilibria. Msxim~ Pareto sulmets are introduced to take over the role of maximal Nash subsets. It is found that the set of Pareto equlh'brh is the f
Snmmary~This paper is concerned with a class of M-" person linear-quadratic nonzero-sum differential games in which a subset of the players have access to closed-loop (CL) information and the rest to open-loop (eL) information. The state equation contains an additive random perturbation term, inclus
In this paper, we first obtain some fixed point theorems in locally convex topological vector spaces which in turn imply some existence theorems of maximal elements for βΏ-condensing correspondences. Then by employing approximation methods, we prove some existence theorems of equilibria for generaliz