Abstract
For the remainder of the paper we assume that S1 and S2 are discrete. It turns out that a great many discrete Silverman games are reducible to 2 by 2 games, in the sense that each player has a 2-component optimal mixed strategy. In this section we shall identify all irreducible 2 by 2 Silverman games, and in the next section are some theorems giving conditions under which games reduce to 2 by 2. “Game” hereafter will always mean “Silverman game.”
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Heuer, G.A., Leopold-Wildburger, U. (1991). The 2 by 2 games. In: Balanced Silverman Games on General Discrete Sets. Lecture Notes in Economics and Mathematical Systems, vol 365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95663-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-95663-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54372-5
Online ISBN: 978-3-642-95663-8
eBook Packages: Springer Book Archive