On games with almost complete information

Abstract

1. It is well known that a game with perfect information has an equilibrium-point of pure strategies; this was first proved for two-person games by Zermelo (9), and later extended to n-person games by Kuhn(3). More recently, Dalkey(1) and Otter and Dunne (8) have published the stronger result (Theorem 6 below): If in the complete inflation of a game Γ every player has complete information about every other player, then Γ has an equilibrium-point of pure strategies.