2000 character limit reached
Brouwer's fixed point theorem with sequentially at most one fixed point
Published 10 Aug 2011 in math.LO and cs.GT | (1108.2201v1)
Abstract: We present a constructive proof of Brouwer's fixed point theorem with sequentially at most one fixed point, and apply it to the mini-max theorem of zero-sum games.
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.