Kakutani fixed-point theorem

Last updated December 20, 2023

In mathematical analysis, the Kakutani fixed-point theorem is a fixed-point theorem for set-valued functions. It provides sufficient conditions for a set-valued function defined on a convex, compact subset of a Euclidean space to have a fixed point, i.e. a point which is mapped to a set containing it. The Kakutani fixed point theorem is a generalization of the Brouwer fixed point theorem. The Brouwer fixed point theorem is a fundamental result in topology which proves the existence of fixed points for continuous functions defined on compact, convex subsets of Euclidean spaces. Kakutani's theorem extends this to set-valued functions.

Statement

Kakutani's theorem states:^[4]

LetSbe a non-empty, compact and convex subset of some Euclidean space Rⁿ.

Letφ: S → 2^Sbe a set-valued function onSwith the following properties:

φ has a closed graph;
φ(x) is non-empty and convex for allx ∈ S.

Thenφhas a fixed point.

Definitions

Set-valued function: A set-valued functionφ from the set X to the set Y is some rule that associates one or more points in Y with each point in X. Formally it can be seen just as an ordinary function from X to the power set of Y, written as φ: X → 2^Y, such that φ(x) is non-empty for every $x\in X$ . Some prefer the term correspondence, which is used to refer to a function that for each input may return many outputs. Thus, each element of the domain corresponds to a subset of one or more elements of the range.
Closed graph: A set-valued function φ: X → 2^Y is said to have a closed graph if the set {(x,y) | y ∈ φ(x)} is a closed subset of X × Y in the product topology i.e. for all sequences $\{x_{n}\}_{n\in \mathbb {N} }$ and $\{y_{n}\}_{n\in \mathbb {N} }$ such that $x_{n}\to x$ , $y_{n}\to y$ and $y_{n}\in \varphi (x_{n})$ for all $n$ , we have $y\in \varphi (x)$ .
Fixed point: Let φ: X → 2^X be a set-valued function. Then a ∈ X is a fixed point of φ if a ∈ φ(a).

Examples

Fixed points for ph(x)=[1-x/2, 1-x/4] Kakutani.svg — Fixed points for φ(x)=[1−x/2, 1−x/4]

A function with infinitely many fixed points

The function: $\varphi (x)=[1-x/2,~1-x/4]$ , shown on the figure at the right, satisfies all Kakutani's conditions, and indeed it has many fixed points: any point on the 45° line (dotted line in red) which intersects the graph of the function (shaded in grey) is a fixed point, so in fact there is an infinity of fixed points in this particular case. For example, x = 0.72 (dashed line in blue) is a fixed point since 0.72 ∈ [1 − 0.72/2, 1 − 0.72/4].

A function with a unique fixed point

The function:

$\varphi (x)={\begin{cases}3/4&0\leq x<0.5\\{}[0,1]&x=0.5\\1/4&0.5<x\leq 1\end{cases}}$

satisfies all Kakutani's conditions, and indeed it has a fixed point: x = 0.5 is a fixed point, since x is contained in the interval [0,1].

A function that does not satisfy convexity

The requirement that φ(x) be convex for all x is essential for the theorem to hold.

Consider the following function defined on [0,1]:

$\varphi (x)={\begin{cases}3/4&0\leq x<0.5\\\{3/4,1/4\}&x=0.5\\1/4&0.5<x\leq 1\end{cases}}$

The function has no fixed point. Though it satisfies all other requirements of Kakutani's theorem, its value fails to be convex at x = 0.5.

A function that does not satisfy closed graph

Consider the following function defined on [0,1]:

$\varphi (x)={\begin{cases}3/4&0\leq x<0.5\\1/4&0.5\leq x\leq 1\end{cases}}$

The function has no fixed point. Though it satisfies all other requirements of Kakutani's theorem, its graph is not closed; for example, consider the sequences x_n = 0.5 - 1/n, y_n = 3/4.

Alternative statement

Some sources, including Kakutani's original paper, use the concept of upper hemicontinuity while stating the theorem:

LetSbe a non-empty, compact and convex subset of some Euclidean space Rⁿ. Letφ: S→2^Sbe an upper hemicontinuous set-valued function onSwith the property thatφ(x) is non-empty, closed, and convex for allx ∈ S. Thenφhas a fixed point.

This statement of Kakutani's theorem is completely equivalent to the statement given at the beginning of this article.

We can show this by using the closed graph theorem for set-valued functions,^[5] which says that for a compact Hausdorff range space Y, a set-valued function φ: X→2^Y has a closed graph if and only if it is upper hemicontinuous and φ(x) is a closed set for all x. Since all Euclidean spaces are Hausdorff (being metric spaces) and φ is required to be closed-valued in the alternative statement of the Kakutani theorem, the Closed Graph Theorem implies that the two statements are equivalent.

Applications

Game theory

The Kakutani fixed point theorem can be used to prove the minimax theorem in the theory of zero-sum games. This application was specifically discussed by Kakutani's original paper.^[1]

Mathematician John Nash used the Kakutani fixed point theorem to prove a major result in game theory.^[2] Stated informally, the theorem implies the existence of a Nash equilibrium in every finite game with mixed strategies for any finite number of players. This work later earned him a Nobel Prize in Economics. In this case:

The base set S is the set of tuples of mixed strategies chosen by each player in a game. If each player has k possible actions, then each player's strategy is a k-tuple of probabilities summing up to 1, so each player's strategy space is the standard simplex in R^k. Then, S is the cartesian product of all these simplices. It is indeed a nonempty, compact and convex subset of R^kn.
The function φ(x) associates with each tuple a new tuple where each player's strategy is her best response to other players' strategies in x. Since there may be a number of responses which are equally good, φ is set-valued rather than single-valued. For each x, φ(x) is nonempty since there is always at least one best response. It is convex, since a mixture of two best-responses for a player is still a best-response for the player. It can be proved that φ has a closed graph.
Then the Nash equilibrium of the game is defined as a fixed point of φ, i.e. a tuple of strategies where each player's strategy is a best response to the strategies of the other players. Kakutani's theorem ensures that this fixed point exists.

General equilibrium

In general equilibrium theory in economics, Kakutani's theorem has been used to prove the existence of set of prices which simultaneously equate supply with demand in all markets of an economy.^[6] The existence of such prices had been an open question in economics going back to at least Walras. The first proof of this result was constructed by Lionel McKenzie.^[7]

In this case:

The base set S is the set of tuples of commodity prices.
The function φ(x) is chosen so that its result differs from its arguments as long as the price-tuple x does not equate supply and demand everywhere. The challenge here is to construct φ so that it has this property while at the same time satisfying the conditions in Kakutani's theorem. If this can be done then φ has a fixed point according to the theorem. Given the way it was constructed, this fixed point must correspond to a price-tuple which equates supply with demand everywhere.

Fair division

Kakutani's fixed-point theorem is used in proving the existence of cake allocations that are both envy-free and Pareto efficient. This result is known as Weller's theorem.

Relation to Brouwer's fixed-point theorem

Brouwer's fixed-point theorem is a special case of Kakutani fixed-point theorem. Conversely, Kakutani fixed-point theorem is an immediate generalization via the approximate selection theorem:^[8]

Proof
By the approximate selection theorem, there exists a sequence of continuous $f_{n}:S\to S$ such that $\operatorname {graph} (f_{n})\subset [\operatorname {graph} (\varphi )]_{1/n}$ . By Brouwer fixed-point theorem, there exists a sequence $x_{n}$ such that $f_{n}(x_{n})=x_{n}$ , so $(x_{n},x_{n})\in [\operatorname {graph} (\varphi )]_{1/n}$ .
Since $S$ is compact, we can take a convergent subsequence $x_{n}\to x$ . Then $(x,x)\in \operatorname {graph} (\varphi )$ since it is a closed set.

Proof outline

S = [0,1]

The proof of Kakutani's theorem is simplest for set-valued functions defined over closed intervals of the real line. However, the proof of this case is instructive since its general strategy can be carried over to the higher-dimensional case as well.

Let φ: [0,1]→2^[0,1] be a set-valued function on the closed interval [0,1] which satisfies the conditions of Kakutani's fixed-point theorem.

Create a sequence of subdivisions of [0,1] with adjacent points moving in opposite directions.

Let (a_i, b_i, p_i, q_i) for i = 0, 1, … be a sequence with the following properties:

1.	1 ≥ b_i>a_i ≥ 0	2.	(b_i − a_i) ≤ 2⁻ⁱ
3.	p_i ∈ φ(a_i)	4.	q_i ∈ φ(b_i)
5.	p_i ≥ a_i	6.	q_i ≤ b_i

Thus, the closed intervals [a_i, b_i] form a sequence of subintervals of [0,1]. Condition (2) tells us that these subintervals continue to become smaller while condition (3)–(6) tell us that the function φ shifts the left end of each subinterval to its right and shifts the right end of each subinterval to its left.

Such a sequence can be constructed as follows. Let a₀ = 0 and b₀ = 1. Let p₀ be any point in φ(0) and q₀ be any point in φ(1). Then, conditions (1)–(4) are immediately fulfilled. Moreover, since p₀ ∈ φ(0) ⊂ [0,1], it must be the case that p₀ ≥ 0 and hence condition (5) is fulfilled. Similarly condition (6) is fulfilled by q₀.

Now suppose we have chosen a_k, b_k, p_k and q_k satisfying (1)–(6). Let,

m = (a_k+b_k)/2.

Then m ∈ [0,1] because [0,1] is convex.

If there is a r ∈ φ(m) such that r ≥ m, then we take,

a_k+1 = m

b_k+1 = b_k

p_k+1 = r

q_k+1 = q_k

Otherwise, since φ(m) is non-empty, there must be a s ∈ φ(m) such that s ≤ m. In this case let,

a_k+1 = a_k

b_k+1 = m

p_k+1 = p_k

q_k+1 = s.

It can be verified that a_k+1, b_k+1, p_k+1 and q_k+1 satisfy conditions (1)–(6).

Find a limiting point of the subdivisions.

The cartesian product [0,1]×[0,1]×[0,1]×[0,1] is a compact set by Tychonoff's theorem. Since the sequence (a_n, p_n, b_n, q_n) lies in this compact set, it must have a convergent subsequence by the Bolzano-Weierstrass theorem. Let's fix attention on such a subsequence and let its limit be (a*, p*,b*,q*). Since the graph of φ is closed it must be the case that p* ∈ φ(a*) and q* ∈ φ(b*). Moreover, by condition (5), p* ≥ a* and by condition (6), q* ≤ b*.

But since (b_i − a_i) ≤ 2⁻ⁱ by condition (2),

b* − a* = (lim b_n) − (lim a_n) = lim (b_n − a_n) = 0.

So, b* equals a*. Let x = b* = a*.

Then we have the situation that

φ(x) ∋ q* ≤ x ≤ p* ∈ φ(x).

Show that the limiting point is a fixed point.

If p* = q* then p* = x = q*. Since p* ∈ φ(x), x is a fixed point of φ.

Otherwise, we can write the following. Recall that we can parameterize a line between two points a and b by (1-t)a + tb. Using our finding above that q<x<p, we can create such a line between p and q as a function of x (notice the fractions below are on the unit interval). By a convenient writing of x, and since φ(x) is convex and

$x=\left({\frac {x-q^{*}}{p^{*}-q^{*}}}\right)p^{*}+\left(1-{\frac {x-q^{*}}{p^{*}-q^{*}}}\right)q^{*}$

it once again follows that x must belong to φ(x) since p* and q* do and hence x is a fixed point of φ.

S is a n-simplex

In dimensions greater one, n-simplices are the simplest objects on which Kakutani's theorem can be proved. Informally, a n-simplex is the higher-dimensional version of a triangle. Proving Kakutani's theorem for set-valued function defined on a simplex is not essentially different from proving it for intervals. The additional complexity in the higher-dimensional case exists in the first step of chopping up the domain into finer subpieces:

Where we split intervals into two at the middle in the one-dimensional case, barycentric subdivision is used to break up a simplex into smaller sub-simplices.
While in the one-dimensional case we could use elementary arguments to pick one of the half-intervals in a way that its end-points were moved in opposite directions, in the case of simplices the combinatorial result known as Sperner's lemma is used to guarantee the existence of an appropriate subsimplex.

Once these changes have been made to the first step, the second and third steps of finding a limiting point and proving that it is a fixed point are almost unchanged from the one-dimensional case.

Arbitrary S

Kakutani's theorem for n-simplices can be used to prove the theorem for an arbitrary compact, convex S. Once again we employ the same technique of creating increasingly finer subdivisions. But instead of triangles with straight edges as in the case of n-simplices, we now use triangles with curved edges. In formal terms, we find a simplex which covers S and then move the problem from S to the simplex by using a deformation retract. Then we can apply the already established result for n-simplices.

Infinite-dimensional generalizations

Kakutani's fixed-point theorem was extended to infinite-dimensional locally convex topological vector spaces by Irving Glicksberg ^[9] and Ky Fan.^[10] To state the theorem in this case, we need a few more definitions:

Upper hemicontinuity: A set-valued function φ: X→2^Y is upper hemicontinuous if for every open set W ⊂ Y, the set {x| φ(x) ⊂ W} is open in X.^[11]
Kakutani map: Let X and Y be topological vector spaces and φ: X→2^Y be a set-valued function. If Y is convex, then φ is termed a Kakutani map if it is upper hemicontinuous and φ(x) is non-empty, compact and convex for all x ∈ X.^[11]

Then the Kakutani–Glicksberg–Fan theorem can be stated as:^[11]

Let S be a non-empty, compact and convex subset of a Hausdorff locally convex topological vector space. Let φ: S→2^S be a Kakutani map. Then φ has a fixed point.

The corresponding result for single-valued functions is the Tychonoff fixed-point theorem.

There is another version that the statement of the theorem becomes the same as that in the Euclidean case:^[5]

Let S be a non-empty, compact and convex subset of a locally convex Hausdorff space. Let φ: S→2^S be a set-valued function on S which has a closed graph and the property that φ(x) is non-empty and convex for all x ∈ S. Then the set of fixed points of φ is non-empty and compact.

Anecdote

In his game theory textbook,^[12] Ken Binmore recalls that Kakutani once asked him at a conference why so many economists had attended his talk. When Binmore told him that it was probably because of the Kakutani fixed point theorem, Kakutani was puzzled and replied, "What is the Kakutani fixed point theorem?"

Related Research Articles

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. (Bertus) Brouwer. It states that for any continuous function $mapping a nonempty compact convex set to itself, there is a point such that . The simplest forms of Brouwer's theorem are for continuous functions from a closed interval in the real numbers to itself or from a closed disk to itself. A more general form than the latter is for continuous functions from a nonempty convex compact subset of Euclidean space to itself.$

In mathematics, any vector space has a corresponding dual vector space consisting of all linear forms on together with the vector space structure of pointwise addition and scalar multiplication by constants.

First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists" is a quantifier, while x is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic.

In mathematics, the mean value theorem states, roughly, that for a given planar arc between two endpoints, there is at least one point at which the tangent to the arc is parallel to the secant through its endpoints. It is one of the most important results in real analysis. This theorem is used to prove statements about a function on an interval starting from local hypotheses about derivatives at points of the interval.

In mathematics, weak topology is an alternative term for certain initial topologies, often on topological vector spaces or spaces of linear operators, for instance on a Hilbert space. The term is most commonly used for the initial topology of a topological vector space with respect to its continuous dual. The remainder of this article will deal with this case, which is one of the concepts of functional analysis.

In mathematics, particularly linear algebra and functional analysis, a spectral theorem is a result about when a linear operator or matrix can be diagonalized. This is extremely useful because computations involving a diagonalizable matrix can often be reduced to much simpler computations involving the corresponding diagonal matrix. The concept of diagonalization is relatively straightforward for operators on finite-dimensional vector spaces but requires some modification for operators on infinite-dimensional spaces. In general, the spectral theorem identifies a class of linear operators that can be modeled by multiplication operators, which are as simple as one can hope to find. In more abstract language, the spectral theorem is a statement about commutative C*-algebras. See also spectral theory for a historical perspective.

In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 and appear in his 1952 book Introduction to Metamathematics. A related theorem, which constructs fixed points of a computable function, is known as Rogers's theorem and is due to Hartley Rogers, Jr.

In mathematics, Jensen's inequality, named after the Danish mathematician Johan Jensen, relates the value of a convex function of an integral to the integral of the convex function. It was proved by Jensen in 1906, building on an earlier proof of the same inequality for doubly-differentiable functions by Otto Hölder in 1889. Given its generality, the inequality appears in many forms depending on the context, some of which are presented below. In its simplest form the inequality states that the convex transformation of a mean is less than or equal to the mean applied after convex transformation; it is a simple corollary that the opposite is true of concave transformations.

In mathematics, a foliation is an equivalence relation on an n-manifold, the equivalence classes being connected, injectively immersed submanifolds, all of the same dimension p, modeled on the decomposition of the real coordinate space Rⁿ into the cosets x + R^p of the standardly embedded subspace R^p. The equivalence classes are called the leaves of the foliation. If the manifold and/or the submanifolds are required to have a piecewise-linear, differentiable, or analytic structure then one defines piecewise-linear, differentiable, or analytic foliations, respectively. In the most important case of differentiable foliation of class C^r it is usually understood that r ≥ 1. The number p is called the dimension of the foliation and q = n − p is called its codimension.

In mathematics, a measure-preserving dynamical system is an object of study in the abstract formulation of dynamical systems, and ergodic theory in particular. Measure-preserving systems obey the Poincaré recurrence theorem, and are a special case of conservative systems. They provide the formal, mathematical basis for a broad range of physical systems, and, in particular, many systems from classical mechanics as well as systems in thermodynamic equilibrium.

In mathematics, the closed graph theorem may refer to one of several basic results characterizing continuous functions in terms of their graphs. Each gives conditions when functions with closed graphs are necessarily continuous.

In mathematics, a number of fixed-point theorems in infinite-dimensional spaces generalise the Brouwer fixed-point theorem. They have applications, for example, to the proof of existence theorems for partial differential equations.

In mathematics, specifically the study of differential equations, the Picard–Lindelöf theorem gives a set of conditions under which an initial value problem has a unique solution. It is also known as Picard's existence theorem, the Cauchy–Lipschitz theorem, or the existence and uniqueness theorem.

In mathematics, particularly in functional analysis, a projection-valued measure (PVM) is a function defined on certain subsets of a fixed set and whose values are self-adjoint projections on a fixed Hilbert space. Projection-valued measures are formally similar to real-valued measures, except that their values are self-adjoint projections rather than real numbers. As in the case of ordinary measures, it is possible to integrate complex-valued functions with respect to a PVM; the result of such an integration is a linear operator on the given Hilbert space.

In mathematics, especially functional analysis, a Fréchet algebra, named after Maurice René Fréchet, is an associative algebra $over the real or complex numbers that at the same time is also a Fréchet space. The multiplication operation for is required to be jointly continuous. If is an increasing family of seminorms for the topology of, the joint continuity of multiplication is equivalent to there being a constant and integer for each such that for all . Fréchet algebras are also called B 0 -algebras.$

In mathematics, the spectral theory of ordinary differential equations is the part of spectral theory concerned with the determination of the spectrum and eigenfunction expansion associated with a linear ordinary differential equation. In his dissertation, Hermann Weyl generalized the classical Sturm–Liouville theory on a finite closed interval to second order differential operators with singularities at the endpoints of the interval, possibly semi-infinite or infinite. Unlike the classical case, the spectrum may no longer consist of just a countable set of eigenvalues, but may also contain a continuous part. In this case the eigenfunction expansion involves an integral over the continuous part with respect to a spectral measure, given by the Titchmarsh–Kodaira formula. The theory was put in its final simplified form for singular differential equations of even degree by Kodaira and others, using von Neumann's spectral theorem. It has had important applications in quantum mechanics, operator theory and harmonic analysis on semisimple Lie groups.

In mathematics, the Pettis integral or Gelfand–Pettis integral, named after Israel M. Gelfand and Billy James Pettis, extends the definition of the Lebesgue integral to vector-valued functions on a measure space, by exploiting duality. The integral was introduced by Gelfand for the case when the measure space is an interval with Lebesgue measure. The integral is also called the weak integral in contrast to the Bochner integral, which is the strong integral.

In functional analysis, a branch of mathematics, a selection theorem is a theorem that guarantees the existence of a single-valued selection function from a given set-valued map. There are various selection theorems, and they are important in the theories of differential inclusions, optimal control, and mathematical economics.

In mathematics, the Markov–Kakutani fixed-point theorem, named after Andrey Markov and Shizuo Kakutani, states that a commuting family of continuous affine self-mappings of a compact convex subset in a locally convex topological vector space has a common fixed point. This theorem is a key tool in one of the quickest proofs of amenability of abelian groups.

In mathematics, calculus on Euclidean space is a generalization of calculus of functions in one or several variables to calculus of functions on Euclidean space $as well as a finite-dimensional real vector space. This calculus is also known as advanced calculus, especially in the United States. It is similar to multivariable calculus but is somewhat more sophisticated in that it uses linear algebra more extensively and covers some concepts from differential geometry such as differential forms and Stokes' formula in terms of differential forms. This extensive use of linear algebra also allows a natural generalization of multivariable calculus to calculus on Banach spaces or topological vector spaces.$

References

1 2 Kakutani, Shizuo (1941). "A generalization of Brouwer's fixed point theorem". Duke Mathematical Journal. 8 (3): 457–459. doi:10.1215/S0012-7094-41-00838-4.
1 2 Nash, J.F. Jr. (1950). "Equilibrium Points in N-Person Games". Proc. Natl. Acad. Sci. U.S.A. 36 (1): 48–49. Bibcode:1950PNAS...36...48N. doi: 10.1073/pnas.36.1.48 . PMC 1063129 . PMID 16588946.
↑ Border, Kim C. (1989). Fixed Point Theorems with Applications to Economics and Game Theory. Cambridge University Press. ISBN 0-521-38808-2.
↑ Osborne, Martin J.; Rubinstein, Ariel (1994). A Course in Game Theory. Cambridge, MA: MIT.
1 2 Aliprantis, Charlambos; Kim C. Border (1999). "Chapter 17". Infinite Dimensional Analysis: A Hitchhiker's Guide (3rd ed.). Springer.
↑ Starr, Ross M. (1997). General Equilibrium Theory. Cambridge University Press. ISBN 978-0-521-56473-1.
↑ McKenzie, Lionel (1954). "On Equilibrium in Graham's Model of World Trade and Other Competitive Systems". Econometrica . 22 (2): 147–161. doi:10.2307/1907539. JSTOR 1907539.
↑ Shapiro, Joel H. (2016). A Fixed-Point Farrago. Springer International Publishing. pp. 68–70. ISBN 978-3-319-27978-7. OCLC 984777840.
↑ Glicksberg, I.L. (1952). "A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium". Proceedings of the American Mathematical Society. 3 (1): 170–174. doi:10.2307/2032478. JSTOR 2032478. Archived from the original on September 22, 2017.
↑ Fan, Ky (1952). "Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces". Proc Natl Acad Sci U S A. 38 (2): 121–126. Bibcode:1952PNAS...38..121F. doi: 10.1073/pnas.38.2.121 . PMC 1063516 . PMID 16589065.
1 2 3 Dugundji, James; Andrzej Granas (2003). "Chapter II, Section 5.8". Fixed Point Theory (limited preview). Springer. ISBN 978-0-387-00173-9.
↑ Binmore, Ken (2007). "When Do Nash Equilibria Exist?". Playing for Real: A Text on Game Theory (1st ed.). Oxford University Press. p. 256. ISBN 978-0-19-804114-6.

External links

"Kakutani theorem", Encyclopedia of Mathematics , EMS Press, 2001 [1994]

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[kakutani-1] 1 2 Kakutani, Shizuo (1941). "A generalization of Brouwer's fixed point theorem". Duke Mathematical Journal. 8 (3): 457–459. doi:10.1215/S0012-7094-41-00838-4.

[nash-2] 1 2 Nash, J.F. Jr. (1950). "Equilibrium Points in N-Person Games". Proc. Natl. Acad. Sci. U.S.A. 36 (1): 48–49. Bibcode:1950PNAS...36...48N. doi: 10.1073/pnas.36.1.48 . PMC 1063129 . PMID 16588946.

[3] ↑ Border, Kim C. (1989). Fixed Point Theorems with Applications to Economics and Game Theory. Cambridge University Press. ISBN 0-521-38808-2.

[Osborne-4] ↑ Osborne, Martin J.; Rubinstein, Ariel (1994). A Course in Game Theory. Cambridge, MA: MIT.

[aliprantis-5] 1 2 Aliprantis, Charlambos; Kim C. Border (1999). "Chapter 17". Infinite Dimensional Analysis: A Hitchhiker's Guide (3rd ed.). Springer.

[6] ↑ Starr, Ross M. (1997). General Equilibrium Theory. Cambridge University Press. ISBN 978-0-521-56473-1.

[7] ↑ McKenzie, Lionel (1954). "On Equilibrium in Graham's Model of World Trade and Other Competitive Systems". Econometrica . 22 (2): 147–161. doi:10.2307/1907539. JSTOR 1907539.

[8] ↑ Shapiro, Joel H. (2016). A Fixed-Point Farrago. Springer International Publishing. pp. 68–70. ISBN 978-3-319-27978-7. OCLC 984777840.

[9] Glicksberg, I.L. (1952). "A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium". Proceedings of the American Mathematical Society. 3 (1): 170–174. doi:10.2307/2032478. JSTOR 2032478. Archived from the original on September 22, 2017.

[10] Fan, Ky (1952). "Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces". Proc Natl Acad Sci U S A. 38 (2): 121–126. Bibcode:1952PNAS...38..121F. doi: 10.1073/pnas.38.2.121 . PMC 1063516 . PMID 16589065.

[dugundji-11] 1 2 3 Dugundji, James; Andrzej Granas (2003). "Chapter II, Section 5.8". Fixed Point Theory (limited preview). Springer. ISBN 978-0-387-00173-9.

[12] ↑ Binmore, Ken (2007). "When Do Nash Equilibria Exist?". Playing for Real: A Text on Game Theory (1st ed.). Oxford University Press. p. 256. ISBN 978-0-19-804114-6.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]