In this chapter we consider two-player games where each player chooses from finitely many pure strategies or randomizes among these strategies. In contrast to Chap. 2 it is no longer required that the sum of the players’ payoffs is zero (or, equivalently, constant). This allows for a much larger class of games, including many games relevant for economic or other applications. Famous examples are the ‘Prisoners’ Dilemma’ and the ‘Battle of the Sexes’ discussed in Sect. 1.3.2.
In Sect. 3.1 we introduce the model and the concept of ‘Nash equilibrium’. Section 3.2 shows how to compute Nash equilibria in pure strategies for arbitrary games, all Nash equilibria in games where both players have exactly two pure strategies, and how to use the concept of strict domination to facilitate computation of Nash equilibria and to compute equilibria also of larger games. The structure of this chapter thus parallels the structure of Chap. 2. For a deeper and more comprehensive analysis of finite two-person games see Chap. 13.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Finite Two-Person Games. In: Game Theory. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69291-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-69291-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69290-4
Online ISBN: 978-3-540-69291-1
eBook Packages: Business and EconomicsEconomics and Finance (R0)