Misplaced Pages

Glicksberg's theorem

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Not to be confused with Glicksberg fixed-point theorem.

In the study of zero sum games, Glicksberg's theorem (also Glicksberg's existence theorem) is a result that shows certain games have a minimax value: . If A and B are Hausdorff compact spaces, and K is an upper semicontinuous or lower semicontinuous function on A × B {\displaystyle A\times B} , then

sup f inf g K d f d g = inf g sup f K d f d g {\displaystyle \sup _{f}\inf _{g}\iint K\,df\,dg=\inf _{g}\sup _{f}\iint K\,df\,dg}

where f and g run over Borel probability measures on A and B.

The theorem is useful if f and g are interpreted as mixed strategies of two players in the context of a continuous game. If the payoff function K is upper semicontinuous, then the game has a value.

The continuity condition may not be dropped: see example of a game with no value.

References

  1. Glicksberg, I. L. (1952). A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points. Proceedings of the American Mathematical Society, 3(1), pp. 170-174, https://doi.org/10.2307/2032478
  2. Sion, Maurice; Wolfe, Phillip (1957), "On a game without a value", in Dresher, M.; Tucker, A. W.; Wolfe, P. (eds.), Contributions to the Theory of Games III, Annals of Mathematics Studies 39, Princeton University Press, pp. 299–306, ISBN 9780691079363


Stub icon

This game theory article is a stub. You can help Misplaced Pages by expanding it.

Categories: