The Lipschitz constant of a finite normal-form game is the maximal change in some player's payoff when a single opponent changes his strategy. We prove that games with small Lipschitz constant admit pure .-equilibria, and pinpoint the maximal Lipschitz constant that is sufficient to imply existence of a pure .-equilibrium as a function of the number of players in the game and the number of strategies of each player. Our proofs use the probabilistic method.
- Large games
- Lipschitz games
- Pure equilibrium
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research