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.”
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.