Example of a game without a value

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Game square (that is, the payoff to player I) for a game with no value, due to Sion and Wolfe. The payoff is 0.5 along the two diagonal lines

In game theory, and in particular the study of zero-sum continuous games, it is commonly assumed that a game has a minimax value. This is the expected value to one of the players when both play a perfect strategy (which is to choose from a particular PDF).

This article gives an example of a zero sum game that has no value. It is due to Sion and Wolfe.[1]

Zero sum games with a finite number of pure strategies are known to have a minimax value (originally proved by John von Neumann) but this is not necessarily the case if the game has an infinite set of strategies. There follows a simple example of a game with no minimax value.

The existence of such zero-sum games is interesting because many of the results of game theory become inapplicable if there is no minimax value.

The game[edit]

Players I and II each choose a number, x and y respectively, with x,y\in[0,1]; the payoff to I is

K(x,y)=
\begin{cases}
  -1 & \text{if } x<y<x+1/2  \\
   0 & \text{if } x=y \text{ or } y=x+1/2\\
   1 & \text{otherwise}
\end{cases}

(i.e. player II pays K(x,y) to player I;the game is zero-sum). Sometimes player I is referred to as the maximizing player and player II the minimizing player.

If (x,y) is interpreted as a point on the unit square, the figure shows the payoff to player I. Now suppose that player I adopts a mixed strategy: choosing a number from probability density function (pdf) f; player II chooses from g. Player I seeks to maximize the payoff, player II to minimize the payoff. Note that each player is aware of the other's objective.

Game value[edit]

Sion and Wolfe show that


\sup_f \inf_g \iint K\,df\,dg=\frac{1}{3}

but


\inf_g \sup_f \iint K\,df\,dg=\frac{3}{7}.

These are the maximal and minimal expectations of the game's value of player I and II respectively.

The \sup and \inf respectively take the supremum and infimum over pdf's on the unit interval (actually Borel probability measures). These represent player I and player II's (mixed) strategies. Thus, player I can assure himself of a payoff of at least 3/7 if he knows player II's strategy; and player II can hold the payoff down to 1/3 if he knows player I's strategy.

There is clearly no epsilon equilibrium for sufficiently small \epsilon, specifically, if \epsilon < \frac{1}{2}\left(\frac{3}{7}-\frac{1}{3}\right)\simeq  0.0476. Dasgupta and Maskin[2] assert that the game values are achieved if player I puts probability weight only on the set \left\{0,1/2,1\right\} and player II puts weight only on \left\{1/4,1/2,1\right\}.

Glicksberg's theorem shows that any zero-sum game with upper or lower semicontinuous payoff function has a value (in this context, an upper (lower) semicontinuous function K is one in which the set \{P|K(P)<c\} (resp \{P|K(P)>c\}) is open for any real c).

Observe that the payoff function of Sion and Wolfe's example is clearly not semicontinuous. However, it may be made so by changing the value of K(xx) and K(xx + 1/2) [i.e. the payoff along the two discontinuities] to either +1 or −1, making the payoff upper or lower semicontinuous respectively. If this is done, the game then has a value.

Generalizations[edit]

Subsequent work by Heuer [3] discusses a class of games in which the unit square is divided into three regions, the payoff function being constant in each of the regions.

References[edit]

  1. ^ Sion, Maurice; Wolfe, Phillip (1957), "On a game without a value", in Dresher, M.; Tucker, A. W.; Wolfe, P., Contributions to the Theory of Games III, Annals of Mathematics Studies 39, Princeton University Press, pp. 299–306, ISBN 9780691079363 
  2. ^ P. Dasgupta and E. Maskin (1986). "The Existence of Equilibrium in Discontinuous Economic Games, I: Theory". Review of Economic Studies 53 (1): 1–26. doi:10.2307/2297588. JSTOR 2297588. 
  3. ^ G. A. Heuer (2001). "Three-part partition games on rectangles". Theoretical Computer Science 259: 639–661. doi:10.1016/S0304-3975(00)00404-7.