Abstract
1.1 Two-person zero-sum games. In this chapter we discuss two-person zero-sum games, i.e. systems of the form
where x and y are arbitrary disjoint sets (cf. 1.1 of Chapter 1), which are called sets of strategies of players 1 and 2, together with H : x × y → R, the payoff function. Here the pairs (x,y) ∈ x × y are called situations in Γ, and the number H(x, y) is the payoff to player 1 (or the loss to player 2) in the situation (x, y). □
In Russian, usually called antagonistic games. (Translatora)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Basel AG
About this chapter
Cite this chapter
Vorob’ev, N.N. (1994). Two-person zero-sum games. In: Foundations of Game Theory. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8514-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8514-0_5
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9659-7
Online ISBN: 978-3-0348-8514-0
eBook Packages: Springer Book Archive