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.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.