Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lipschitz Games (1107.1520v2)

Published 7 Jul 2011 in math.CO and cs.GT

Abstract: 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 {\epsilon}-equilibria, and pinpoint the maximal Lipschitz constant that is sufficient to imply existence of pure {\epsilon}-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.

Citations (37)

Summary

We haven't generated a summary for this paper yet.