2000 character limit reached
Constructive proof of the existence of Nash Equilibrium in a finite strategic game with sequentially locally non-constant payoff functions by Sperner's lemma (1103.1980v3)
Published 10 Mar 2011 in math.LO and cs.GT
Abstract: Using Sperner's lemma for modified partition of a simplex we will constructively prove the existence of a Nash equilibrium in a finite strategic game with sequentially locally non-constant payoff functions. We follow the Bishop style constructive mathematics.
Paper 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.