On the set of (perfect) equilibria of a bimatrix game
β Scribed by A. J. Vermeulen; M. J. M. Jansen
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 381 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
This article provides a new approach to the set of (perfect) equilibria. With the help of an equivalence relation on the strategy space of each player, Nash sets and Selten sets are introduced. The number of these sets is finite and each of these sets is a polytope. As a consequence the set of (perfect) equilibria is a finite union of polytopes. o 1994 John Wiley & Sons. Inc.
π SIMILAR VOLUMES
## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, Ξ³(__H__) = __i__(__H__), where Ξ³ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of