Abstract
In this paper we provide a characterization of the set of fall back equilibria for \(2 \times n\) bimatrix games. Furthermore, for this type of games we discuss the relation between the set of fall back equilibria and the sets of perfect, proper and strictly perfect equilibria. In order to do this we reformulate the existing characterizations for these three equilibrium concepts by the use of refinement-specific subgames.
Similar content being viewed by others
Notes
A strategy \(q \in \Delta _N\) is dominated if there exists a strategy \(\bar{q}\in \Delta _N\) such that \(pB\bar{q}\ge pBq\) for all \(p \in \Delta _M\) and \(pB\bar{q}>pBq\) for some \(p \in \Delta _M\).
In Kleppe et al. (2012a) the notation \(PS\) is used for the set of pure secondary replies. However, to clearly distinguish between the set of pure solutions and the set of pure secondary replies, we use the notation \(\textit{PSR}\) for the latter in this paper.
References
Borm P (1992) On perfectness concepts for bimatrix games. OR Spektrum 14:33–42
Borm P, Geijsberts A, Tijs S (1988) A geometric-combinatorial approach to bimatrix games. Methods Oper Res 59:199–209
Borm P, Jansen M, Potters J, Tijs S (1993) On the structure of the set of perfect equilibria in bimatrix games. OR Spektrum 15:17–20
Jansen M (1993) On the set of proper equilibria of a bimatrix game. Int J Game Theory 22:97–106
Kleppe J, Borm P, Hendrickx R (2012a) Fall back equilibrium. Eur J Oper Res 223:372–379
Kleppe J, Borm, P, Hendrickx R (2012b) A strategic foundation for proper equilibrium. CentER Discussion Paper 093. Tilburg University, Tilburg
Lemke C, Howson J (1964) Equilibrium points of bimatrix games. J Soc Ind Appl Math 12:413–423
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 (1984) Strictly perfect equilibrium points of bimatrix games. Int J Game Theory 13:145–154
Papadimitriou CH (2001) Algorithms, games, and the Internet. In: In STOC. ACM Press, pp 749–753
Porter R, Nudelman E, Shoham Y (2004) Simple search methods for finding Nash equilibrium. Proc AAAI 04:664–669
Selten R (1975) Reexamination of the perfectness concept for equilibrium points in extensive games. Int J Game Theory 4:25–55
Tucker A (1960) Solving a matrix game by linear programming. J Res Dev 4:507–517
Vermeulen A, Jansen M (1996) Are strictly perfect equilibria proper? A counterexample. J Optim Theory Appl 90:225–230
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kleppe, J., Borm, P. & Hendrickx, R. Fall back equilibrium for \(2 \times n\) bimatrix games. Math Meth Oper Res 78, 171–186 (2013). https://doi.org/10.1007/s00186-013-0438-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-013-0438-5