Existence of a nash equilibrium mit opencourseware. In the literature, brouwer theorem has been used to. Fixed points for kakutani factorizable multifunctions core. In mathematical analysis, the kakutani fixedpoint theorem is a fixedpoint theorem for setvalued functions. Assume that the graph of the setvalued functions is closed in x. Kakutani s fixed point theorem theorem kakutani let a be a nonempty subset of a. The kakutani fixed point theorem, kakutani 1941, which kakutani devel. Real analysis with economic applications request pdf. Fixed point theory is a fascinating subject, with an enormous number of applications in various fields of.
The kakutani fixed point theorem is can be stated as follows. It provides sufficient conditions for a setvalued function defined on a convex, compact subset of a euclidean space to have a fixed point, i. Many existence problems in economics for example existence of competitive equilibrium in general equilibrium theory, existence of nash in equilibrium in game theory. Let c he a nonempty closed convex subset in a hausdorff topological vector space e and f. Fixed point theorems fixed point theorems concern maps f of a set x into itself that, under certain conditions, admit a. Using this, the rest of the proof is standard, it is obtained as a consequence of the kakutani s fixed point theorem 12 also with the help of the berges maximum theorem, see e. This theorem was originally by markov, with an alternative proof provided in 1938 by.
The object of this note is to point out that kakutanis theorem may be extended. Sperner lemma, fixed point theorems, and the existence of. Fixed points for kakutani factorizable multifunctions sciencedirect. The kakutani fixed point theorem is a generalization of brouwer fixed point theorem. This simple example is typical of the frustrations of the contraction. There is a proof of sperners lemma that provides an algorithm for. Call crcompact a space that can be expressed as the union of at. Some applications of the kakutani fixed point theorem. X is a correspondence from x into itself that is 1. It is seen that this theorem duplicates the tychonoff extension of brouwers theorem for kakutanis theorem, and includes this in the.
Our main result is a fixed point theorem for a commutative family of. You can use the method of proof to construct a solution. Pdf it is often demonstrated that brouwers fixed point theorem can not be constructively proved. Combining this inclusion relation and 35, we see that. Kakutani showed that this implied the minimax theorem for finite games. Proof of constructive version of the fanglicksberg fixed point. Kakutanis fixed point theorem 31 states that in euclidean space a closed point to nonvoid convex set map of a convex compact set into itself has a fixed point. Let ariae 1 be a decreasing chain of nonempty compact.
Kakutanis fixed point theorem theorem kakutani let a be a nonempty subset of a. We use kakutanis fixed point theorem, for example, to prove existence of a mixed. Application of the brouwer and the kakutani fixedpoint theorems to. We prove sperners lemma, brouwers fixed point theorem, and kakutani s fixed point theorem, and apply these theorems to demonstrate the conditions for existence of nash equilibria in strategic games. The proof of kakutanis theorem is a mixture of franklin 1980 and kakutani 1941. Kakutanis fixed point theorem and the minimax theorem in game theory5 since x. C 2e he a map such that 1 fx is closed for each xe c. Sperners lemma, the brouwer fixed point theorem, the kakutani. Rn is a nonempty, compact, and convex set, and that f. Kakutani fixed point theorem 121 using theorem 2, we now prove an interesting fact, which can be com pared with fans fixed point theorem 3. Suppose that x has the fixed point property, that h. Given a closed point to convex set mapping s of a convex compact subset s of a convex hausdorff linear topological space into itself there exists a fixed point x. Kakutani showed in 1 that from his theorem, the minimax principle for finite games does follow. Here we study them for general functions as well as for correspondences.
1533 1235 402 1202 627 290 757 1072 696 1253 1476 604 1489 260 331 408 1241 1083 1478 800 130 415 77 1591 491 834 1055 333 1090 942 384 1256 1048 199 1105 1141 407 177 409 654 1017 977 199 704