Summary
It is shown that the perfect and the proper equilibria for 2×n bimatrix games can be determined systematically by means of the geometric-combinatorial approach of Borm et al. (1988). Moreover, for these games, stable sets and persistent retracts can be characterized. In particular, it is found that each stable set consists of either one or two perfect equilibria, that each stable component contains a proper equilibrium and that each persistent equilibrium is perfect.
Zusammenfassung
Ein Prozedur für die Bestimmung aller perfekten, properen und persistenten Gleichgewichte als aller stabilen Mengen eines 2×n Bimatrix Spieles wird angegeben. Besonders folgt, daß jede stabile Menge entweder ein oder zwei Elemente hat, daß jede stabile Komponente ein properes Gleichgewicht enthält und daß jedes persistente Gleichgewicht perfekt ist.
Similar content being viewed by others
References
Borm P, Gijsberts A (1990) On constructing games with a convex set of equilibrium strategies. Z Oper Res 34:279–302
Borm P, Gijsberts A, Tijs S (1988)) A geometric-combinatorial approach to bimatrix games. Methods Oper Res 59:199–209
Damme E van (1983) Refinements of the Nash equilibrium concept. (Lect Notes Econ, vol 219) Springer, Berlin Heidelberg New York
Damme E van (1987) Equilibria in noncooperative games. In: Vrieze O, Peters H (eds) Surveys in game theory and related topics. (CWI-Tract 39) Centre for Mathematics and Computer Science, Amsterdam, pp 1–36
Jansen M, Jurg P, Borm P (1992) On the finiteness of stable sets. Games Econ Behavior (to appear)
Kalai E, Samet D (1984) Persistent equilibria. Int J Game Theory 13:129–144
Kohlberg E, Mertens JF (1986) On the strategic stability of equilibria. Econometrica 54:1003–1038
Mertens JF (1989) Stable equilibria—a reformulation; part I. Math Oper Res 14:575–625
Myerson R (1978) Refinements of the Nash equilibrium point concept. Int J Game Theory 7:73–80
Nash J (1951) Non-cooperative games. Ann Math 54:286–295
Okada A (1983) Robustness of equilibrium points in strategic games. Report B-137, Department of Systems Science, Tokyo Institute of Technology
Okada A (1984) Strictly perfect equilibrium points of bimatrix games. Int J Game Theory 13:145–154
Selten R (1975) Reexamination of the perfectness concept for equilibrium points in extensive games. Int J Game Theory 4:25–55
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Borm, P. On perfectness concepts for bimatrix games. OR Spektrum 14, 33–42 (1992). https://doi.org/10.1007/BF01783500
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01783500