<p>Just wanted to add that in general, you can show this holds for any finite two-player game. I will not repeat the proof, as it is easily found online (e.g. <a href="http://math.uchicago.edu/~shmuel/AAT-readings/Econ%20segment/nash.pdf" rel="nofollow noreferrer">this one</a>). It is also worth nothing that you can prove this result with other fixed point theorems. The most notable example is probably Kakutani's fixed point theorem, where the existence of NE is proven with correspondences (see <a href="http://www.library.fa.ru/files/Tirole-Game.pdf" rel="nofollow noreferrer">Fudenberg and Tirole</a>). </p>

<p>Just thought you might want to know if you are looking more into this!</p>

CC BY-SA 3.0
2017-10-24T07:31:33.190Z
Bear in mind that the OP is asking about guaranteeing the existence of equilibria in **completely mixed** strategies. The results you refer do not seem to apply, since they only guarantee the existence of *some* equilibrium (which may we’ll be pure).
Theoretical Economist
CC BY-SA 3.0
2017-10-24T13:39:36.567Z
@TheoreticalEconomist I am quite sure that for any **finite** game there will also be a fixed point over the restricted mixed strategy place the OP is asking about. E.g. for Prisoner's Dilemma it would be $(g,g)$, as lower probabilites of cooperation are not allowed.
Giskard
CC BY-SA 3.0
2017-10-24T13:43:06.637Z
@denesp That is true, but in general I believe there is no way to guarantee that the equilibria of the restricted game (where players are required to play all strategies with positive probability) are also equilibria of the original game.
Theoretical Economist
CC BY-SA 3.0
2017-10-24T14:18:14.020Z
@TheoreticalEconomist You are correct, and that was indeed part of the question. It slipped my mind.
Giskard
CC BY-SA 3.0
2017-10-24T19:26:32.457Z
Exactly, the problem is one cannot guarante, without further restrictions on utility functions, using proofs like those of Nash Theorem, that the fixed point exists in completely mixed strategies.
RAGMS
CC BY-SA 3.0
2017-10-24T19:29:32.540Z
@denesp, furthermore, one cannot guarantee in an open interval the players would not prefer the limits, just take as an example a game with a nash eq. in strictly dominating strategies. Thus, the completely mixed strategy eq. would not make sense.
RAGMS
CC BY-SA 3.0
2017-10-24T20:18:42.830Z
@Ramiro I am not sure why your comment is addressed to me, I made no claims about open intervals.
Giskard
CC BY-SA 3.0
2017-10-24T03:59:46.553Z
2017-10-24T03:59:46.553Z
JDY
<p>Rather than deprive you of the joy of solving your own problem, I will show how one can also use Brouwer's theorem to show that the function $f:\mathbb{R} \to \mathbb{R}$
$$
f(x) = \frac{33+x}{16+x^4}
$$
has a fixed point, even though its range is not compact.</p>

<p>Note that $f(1) = 2$ and $f(2) = 35/32$. As $f$ is monotonically decreasing over $[1,2]$, this also means that $f([1,2]) \subset [1,2]$. Also, $[1,2]$ is compact and $f$ is continuous over this set. So $f: [1,2] \to [1,2]$ will have a fixed point by Brouwer's fixed point theorem.</p>

<p>Similar tricks are used in game theory and general equilibrium theory. By showing that the optimal decisions by some players cannot possibly be outside of some boundaries one can frequently create a compact space over which fixed point theorems are applicable.</p>

CC BY-SA 3.0
2017-10-23T09:47:56.040Z
Thank you for the input, although, I am familiar with such reasoning. My problem here is one cannot set a priori restrictions without knowing the completely mixed strategy equilibrium indeed exists, giving no point to the use of the theorem...
RAGMS
CC BY-SA 3.0
2017-10-23T10:03:00.873Z
@Ramiro Yes, the easy to see equilibrium is difficult to ignore. You can define some sort of $g$-best response which assigns at least probability $g$ to all strategies. (E.g. g = 5%.) Trivially this maps the $[g,1-g]^2$ subset of the mixed strategy space unto itself, so it has a fixed point. Then all you have to show is that the fixed point is not at the boundary. If the fixed point is indeed in the interior than the $g$-best response is also a best response.
Giskard
CC BY-SA 3.0
2017-10-22T23:11:16.653Z
2017-10-22T23:11:16.653Z
Giskard
<p>How can one use Brouwer's Fixed Point Theorem to prove that the following game F has a solution:</p>

<p>F is defined as N={L,R} Ai=(g,1-g) where g must be positive and smaller than 1, that is, each player plays a completely mixed strategy and has the following payoff matrix:</p>

<p>\begin{array}{|c|c|c|}
\hline 
&amp;LU&amp;LD\\\hline
RU&amp;0,0&amp;6,3\\\hline
RD&amp;3,6&amp;0,0\\\hline
\end{array}</p>

<p>I reached the conclusion that one cannot use such theorem to prove there exists a solution to the game since the plays do not belong to a compact set. Can anyone use it?</p>

CC BY-SA 3.0
2017-10-22T20:40:55.243Z
This question seems rather odd. Why would you use Brouwer to demonstrate the existence of a completely mixed equilibrium when, as you point out, the space of completely mixed strategies is not compact, and the existence of a completely mixed equilibrium is easy enough to demonstrate by construction?
Theoretical Economist
<mathematical-economics><game-theory>
Use Brouwer's Fixed Point Theorem to Prove existence of equilibrium(a) with completely mixed strategies
RAGMS
# Use Brouwer's Fixed Point Theorem to Prove existence of equilibrium(a) with completely mixed strategies

(Asked by: username_0 on 2017-10-22)

How can one use Brouwer's Fixed Point Theorem to prove that the following game F has a solution:

F is defined as N={L,R} Ai=(g,1-g) where g must be positive and smaller than 1, that is, each player plays a completely mixed strategy and has the following payoff matrix:

\begin{array}{|c|c|c|}
\hline
&LU&LD\\\hline
RU&0,0&6,3\\\hline
RD&3,6&0,0\\\hline
\end{array}

I reached the conclusion that one cannot use such theorem to prove there exists a solution to the game since the plays do not belong to a compact set. Can anyone use it?

**Tags:** mathematical-economics, game-theory
> **Comments:**
> **username_1**: This question seems rather odd. Why would you use Brouwer to demonstrate the existence of a completely mixed equilibrium when, as you point out, the space of completely mixed strategies is not compact, and the existence of a completely mixed equilibrium is easy enough to demonstrate by construction?  

---

## 2 answers

### Answer by username_3 on 2017-10-22. Score: 6 | Accepted answer

Rather than deprive you of the joy of solving your own problem, I will show how one can also use Brouwer's theorem to show that the function $f:\mathbb{R} \to \mathbb{R}$
$$
f(x) = \frac{33+x}{16+x^4}
$$
has a fixed point, even though its range is not compact.

Note that $f(1) = 2$ and $f(2) = 35/32$. As $f$ is monotonically decreasing over $[1,2]$, this also means that $f([1,2]) \subset [1,2]$. Also, $[1,2]$ is compact and $f$ is continuous over this set. So $f: [1,2] \to [1,2]$ will have a fixed point by Brouwer's fixed point theorem.

Similar tricks are used in game theory and general equilibrium theory. By showing that the optimal decisions by some players cannot possibly be outside of some boundaries one can frequently create a compact space over which fixed point theorems are applicable.

> **Comments:**
> **username_0**: Thank you for the input, although, I am familiar with such reasoning. My problem here is one cannot set a priori restrictions without knowing the completely mixed strategy equilibrium indeed exists, giving no point to the use of the theorem...  
> **username_3**: @Ramiro Yes, the easy to see equilibrium is difficult to ignore. You can define some sort of $g$-best response which assigns at least probability $g$ to all strategies. (E.g. g = 5%.) Trivially this maps the $[g,1-g]^2$ subset of the mixed strategy space unto itself, so it has a fixed point. Then all you have to show is that the fixed point is not at the boundary. If the fixed point is indeed in the interior than the $g$-best response is also a best response.  

---

### Answer by username_2 on 2017-10-24. Score: 0

Just wanted to add that in general, you can show this holds for any finite two-player game. I will not repeat the proof, as it is easily found online (e.g. [this one](http://math.uchicago.edu/~shmuel/AAT-readings/Econ%20segment/nash.pdf)). It is also worth nothing that you can prove this result with other fixed point theorems. The most notable example is probably Kakutani's fixed point theorem, where the existence of NE is proven with correspondences (see [Fudenberg and Tirole](http://www.library.fa.ru/files/Tirole-Game.pdf)).

Just thought you might want to know if you are looking more into this!

> **Comments:**
> **username_1**: Bear in mind that the OP is asking about guaranteeing the existence of equilibria in **completely mixed** strategies. The results you refer do not seem to apply, since they only guarantee the existence of *some* equilibrium (which may we’ll be pure).  
> **username_3**: @TheoreticalEconomist I am quite sure that for any **finite** game there will also be a fixed point over the restricted mixed strategy place the OP is asking about. E.g. for Prisoner's Dilemma it would be $(g,g)$, as lower probabilites of cooperation are not allowed.  
> **username_1**: @denesp That is true, but in general I believe there is no way to guarantee that the equilibria of the restricted game (where players are required to play all strategies with positive probability) are also equilibria of the original game.  
> **username_3**: @TheoreticalEconomist You are correct, and that was indeed part of the question. It slipped my mind.  
> **username_0**: Exactly, the problem is one cannot guarante, without further restrictions on utility functions, using proofs like those of Nash Theorem, that the fixed point exists in completely mixed strategies.  
> **username_0**: @denesp, furthermore, one cannot guarantee in an open interval the players would not prefer the limits, just take as an example a game with a nash eq. in strictly dominating strategies. Thus, the completely mixed strategy eq. would not make sense.  
> **username_3**: @Ramiro I am not sure why your comment is addressed to me, I made no claims about open intervals.  

---

