Brouwer's fixed point theorem with sequentially at most one fixed point

2011/08/10 by Yasuhito Tanaka, Tanaka, Yasuhito
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics #Formal Methods in Verification #Logic (math.LO) #Numerical Methods and Algorithms #cs.GT #math.LO

paper · pdf · doi:10.48550/arxiv.1108.2201

arxiv created 2011/08/10 · openalex publication_date 2011/08/10 · arxiv updated 2011/08/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Using Brouwer's fixed point theorem
• An easily verifiable proof of the Brouwer fixed point theorem
• An optimal Brouwer's fixed point theorem for discontinuous functions
• Constructive proof of Brouwer's fixed point theorem for sequentially locally non-constant functions
• Constructive proof of Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions by Sperner's lemma