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

TL;DR
This paper provides a constructive proof of Brouwer's fixed point theorem ensuring at most one fixed point, and demonstrates its application to the mini-max theorem in zero-sum games.
Contribution
It introduces a constructive proof of Brouwer's fixed point theorem with a unique fixed point condition and applies it to game theory.
Findings
Constructive proof of Brouwer's fixed point theorem
Application to mini-max theorem in zero-sum games
Establishment of at most one fixed point in the proof
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Computability, Logic, AI Algorithms · Formal Methods in Verification
