Two-person zero-sum games

Abstract

1.1 Two-person zero-sum games. In this chapter we discuss two-person zero-sum games, i.e. systems of the form $$ \Gamma = \left\langle {x,y,H} \right\rangle , $$ 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). □KeywordsSaddle PointOptimal StrategyPayoff FunctionMixed StrategyPure StrategyThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.