<p>Note that Nash equilibrium means no one can benefit from unilateral deviation.
In this case, if <span class="math-container">$s_1 = s_{1}^*$</span> (i.e. Nash Equilibrium), then it must be that <span class="math-container">$s_1+s_2=8$</span> since otherwise, player 1 or 2 can deviate and benefit (for example, if <span class="math-container">$s_1+s_2&lt;8$</span>, p1 can order more to let <span class="math-container">$s_{1}^{\prime}+s_2=8$</span> and benefit).</p>

<p>So, back to your question, any pair that makes <span class="math-container">$s_{1}+s_{2}=8$</span> is a Nash equilibrium, so, there are 9 NEs, with <span class="math-container">$s_{1}^{*}\in\{0,\cdots,8\}$</span>, and given a  <span class="math-container">$s_{1}^{*}$</span>, <span class="math-container">$s_{2}^{*}=8-s_{1}^{*}$</span>. I guess the notation <span class="math-container">$s1&gt;s^{*}$</span>is confusing, it should mean that given a fixed <span class="math-container">$s_{1}^{*}$</span>, if p1 deviates to <span class="math-container">$s_{1}&lt;s_{1}^{*}$</span>, then p2's best response is to increase his number from <span class="math-container">$s_{2}^*$</span> to <span class="math-container">$s_2$</span> and make <span class="math-container">$s_2+s_1=8$</span> again. </p>

CC BY-SA 4.0
2019-03-16T01:57:07.180Z
You've listed only the equilibria that occur in the static version of the game. In the sequential version, player 2's strategy set is more complex than $\{0,1,...,8\}$, and hence there are more equilibria than just those you mentioned. Take a look at my solution below.
dlnB
CC BY-SA 4.0
2019-03-16T02:22:53.663Z
@dlnB You are right, I didn't read the question very carefully, sorry about that.
The R
CC BY-SA 4.0
2019-03-15T22:56:59.297Z
2019-03-15T22:56:59.297Z
The R
<p>The above post is pretty close (+1), but has not mentioned the subgame perfect Nash Equilibrium and the notation <span class="math-container">$s_2^*=8-s_1^*$</span> might be misleading, as it implies that player 2's Nash Equilibrium strategy is a function of <span class="math-container">$s_1$</span>, which would mean the best response for player 1 could not be anything less than 8. </p>

<p>First consider the action set for each player (each has the same action set):
<span class="math-container">$$a_1 \in \{0,1,2,...,8\}$$</span>
<span class="math-container">$$a_2 \in \{0,1,2,...,8\}$$</span></p>

<p>First consider the strategy set for each player:
<span class="math-container">$$s_1 \in \{0,1,2,...,8\}$$</span>
<span class="math-container">$$s_2(s_1) \in \{f: \{0,1,2,...,8\} \rightarrow \{0,1,2,...,8\}\}.$$</span>
Notice that player 1's strategy set is the same as her action set, since player 1 cannot condition her action on player 2's action before moving. On the other hand, player 2's strategy set is the set of all functions mapping player 1's action set into player 2's action set. </p>

<p>If we consider the definition of a Nash Equilibrium,and carefully consider the strategy sets for each player, we can see there are at least 10 Pure Strategy Nash Equilibria: 
<span class="math-container">$$(s_1^*,s_2^*) \in \{(0,8),(1,7),(2,6),(3,5),(4,4),(5,3),(6,1),(7,1),(8,0),(8,8-s_1)\}.$$</span>
In the first 9 equilibria listed (i.e. those the first poster was describing), firm 2's equilibrium strategy is simply a number, not a function that depends on player 1's strategy (e.g. <span class="math-container">$s_2(s_1)=4$</span>). Notice these would be the equilibria if this were a static game (meaning player 2 did not observe player 1's choice before choosing an action). </p>

<p>The last equilibrium listed <span class="math-container">$(8,8-s_1)$</span> is the subgame perfect Nash Equilibrium. To see why, we must use backward induction. Starting with player 2's move, we have 9 possible subgames (one for each of the possible actions chosen by player 1). For the arbitrary subgame in which <span class="math-container">$s_1=C$</span>, player 2's best response is to choose the action corresponding to <span class="math-container">$8-C$</span>. We can generalize this across the 9 subgames and deduce that the strategy <span class="math-container">$s_2(s_1)=8-s_1$</span> forms a Nash Equilibrium in each of these 9 proper subgames. </p>

<p>So we have determined that in the subgame perfect Nash Equilibrium, player 2 must choose strategy <span class="math-container">$s_2(s_1)=8-s_1$</span>. We must now find player 1's best response, which can easily be seen to be <span class="math-container">$s_1=8$</span>. Thus the 10th Nash Equilibrium listed above is the subgame perfect Nash Equilibrium. </p>

<p>You might be inclined to argue that <span class="math-container">$(8,0)$</span> and <span class="math-container">$(8,8-s_1)$</span> are equivalent outcomes, but they are not. The former cannot be a subgame perfect Nash Equilibrium since player 2's strategy <span class="math-container">$s_2(s_1)=0$</span> does not form a Nash Equilibrium in every proper subgame (e.g. in the subgame where player 1 had chosen <span class="math-container">$s_1=7$</span>, player 2 would still have chosen <span class="math-container">$s_2(7)=0$</span>.</p>

CC BY-SA 4.0
2019-03-15T23:28:04.940Z
2019-03-15T23:28:04.940Z
dlnB
<p>In a sequential game, where there are 8 pizzas.</p>

<p>Player 1 decides number of pizzas he wants. Let's call it S1 (strategy of player 1), and S1 = 5 means player one decided to get 5 pizzas.</p>

<p>Then player 2 decides number of pizzas he wants, and player 2 knows what player 1 decided. Let's call it S2 (strategy of player 2), and S2 = 5 means player two decided to get 5 pizzas.</p>

<p>If the S1 + S2 > 8 then both players get 0 pizzas.</p>

<p>Else, the players get the number of pizzas that they decided to get, also player 1 gets S1 pizzas and player two gets S2 pizzas.</p>

<p>In "solutions" to exercises to an assignment about strategies, they have written the following:</p>

<p>S1* and S2* are "Nash equilibrium" strategies of the player 1 and player 2.</p>

<p>Find all the Nash equilibrium in pure strategies in this sequential game.</p>

<pre><code>(1) S1* ∈ {0, 1, 2, 3, 4, 5, 6, 7, 8} and
S2*(S1) = 8 - S1   if   S1 = S1*,
S2*(S1) &gt; 8 - s1   if   S1 &gt; S1*,
S2*(S1) ∈ {0, 1, 2, 3, 4, 5, 6, 7, 8}   if   S1 &lt; S1*
</code></pre>

<p>What does it mean that S1 > S1* or S1 &lt; S1*</p>

<p>It means The player 1 decides a number of pizza which is greater than 8?</p>

<p>What does the notations above mean?</p>

CC BY-SA 4.0
2019-03-14T09:31:00.317Z
@Giskard ok I accepted it l now, I forgot this feature here. But can you answer the question or?
Coder88
CC BY-SA 4.0
2019-03-16T01:55:13.417Z
I'm also confused by the notation you listed, but I've provided a solution with (hopefully) less confusing notation below. I'm happy to elaborate.
dlnB
<game-theory><nash-equilibrium>
What does these "strategy notations" mean?
Coder88
# What does these "strategy notations" mean?

(Asked by: username_0 on 2019-03-13)

In a sequential game, where there are 8 pizzas.

Player 1 decides number of pizzas he wants. Let's call it S1 (strategy of player 1), and S1 = 5 means player one decided to get 5 pizzas.

Then player 2 decides number of pizzas he wants, and player 2 knows what player 1 decided. Let's call it S2 (strategy of player 2), and S2 = 5 means player two decided to get 5 pizzas.

If the S1 + S2 > 8 then both players get 0 pizzas.

Else, the players get the number of pizzas that they decided to get, also player 1 gets S1 pizzas and player two gets S2 pizzas.

In "solutions" to exercises to an assignment about strategies, they have written the following:

S1\* and S2\* are "Nash equilibrium" strategies of the player 1 and player 2.

Find all the Nash equilibrium in pure strategies in this sequential game.

```
(1) S1* ∈ {0, 1, 2, 3, 4, 5, 6, 7, 8} and
S2*(S1) = 8 - S1   if   S1 = S1*,
S2*(S1) > 8 - s1   if   S1 > S1*,
S2*(S1) ∈ {0, 1, 2, 3, 4, 5, 6, 7, 8}   if   S1 < S1*

```

What does it mean that S1 > S1\* or S1 < S1\*

It means The player 1 decides a number of pizza which is greater than 8?

What does the notations above mean?

**Tags:** game-theory, nash-equilibrium

> **Comments:**
> **username_0**: @Giskard ok I accepted it l now, I forgot this feature here. But can you answer the question or?  
> **username_1**: I'm also confused by the notation you listed, but I've provided a solution with (hopefully) less confusing notation below. I'm happy to elaborate.  

---

## 2 answers

### Answer by username_1 on 2019-03-15. Score: 4 | Accepted answer

The above post is pretty close (+1), but has not mentioned the subgame perfect Nash Equilibrium and the notation $s\_2^\*=8-s\_1^\*$ might be misleading, as it implies that player 2's Nash Equilibrium strategy is a function of $s\_1$, which would mean the best response for player 1 could not be anything less than 8.

First consider the action set for each player (each has the same action set):
$$a\_1 \in \{0,1,2,...,8\}$$
$$a\_2 \in \{0,1,2,...,8\}$$

First consider the strategy set for each player:
$$s\_1 \in \{0,1,2,...,8\}$$
$$s\_2(s\_1) \in \{f: \{0,1,2,...,8\} \rightarrow \{0,1,2,...,8\}\}.$$
Notice that player 1's strategy set is the same as her action set, since player 1 cannot condition her action on player 2's action before moving. On the other hand, player 2's strategy set is the set of all functions mapping player 1's action set into player 2's action set.

If we consider the definition of a Nash Equilibrium,and carefully consider the strategy sets for each player, we can see there are at least 10 Pure Strategy Nash Equilibria:
$$(s\_1^\*,s\_2^\*) \in \{(0,8),(1,7),(2,6),(3,5),(4,4),(5,3),(6,1),(7,1),(8,0),(8,8-s\_1)\}.$$
In the first 9 equilibria listed (i.e. those the first poster was describing), firm 2's equilibrium strategy is simply a number, not a function that depends on player 1's strategy (e.g. $s\_2(s\_1)=4$). Notice these would be the equilibria if this were a static game (meaning player 2 did not observe player 1's choice before choosing an action).

The last equilibrium listed $(8,8-s\_1)$ is the subgame perfect Nash Equilibrium. To see why, we must use backward induction. Starting with player 2's move, we have 9 possible subgames (one for each of the possible actions chosen by player 1). For the arbitrary subgame in which $s\_1=C$, player 2's best response is to choose the action corresponding to $8-C$. We can generalize this across the 9 subgames and deduce that the strategy $s\_2(s\_1)=8-s\_1$ forms a Nash Equilibrium in each of these 9 proper subgames.

So we have determined that in the subgame perfect Nash Equilibrium, player 2 must choose strategy $s\_2(s\_1)=8-s\_1$. We must now find player 1's best response, which can easily be seen to be $s\_1=8$. Thus the 10th Nash Equilibrium listed above is the subgame perfect Nash Equilibrium.

You might be inclined to argue that $(8,0)$ and $(8,8-s\_1)$ are equivalent outcomes, but they are not. The former cannot be a subgame perfect Nash Equilibrium since player 2's strategy $s\_2(s\_1)=0$ does not form a Nash Equilibrium in every proper subgame (e.g. in the subgame where player 1 had chosen $s\_1=7$, player 2 would still have chosen $s\_2(7)=0$.


---

### Answer by username_2 on 2019-03-15. Score: 1

Note that Nash equilibrium means no one can benefit from unilateral deviation.
In this case, if $s\_1 = s\_{1}^\*$ (i.e. Nash Equilibrium), then it must be that $s\_1+s\_2=8$ since otherwise, player 1 or 2 can deviate and benefit (for example, if $s\_1+s\_2<8$, p1 can order more to let $s\_{1}^{\prime}+s\_2=8$ and benefit).

So, back to your question, any pair that makes $s\_{1}+s\_{2}=8$ is a Nash equilibrium, so, there are 9 NEs, with $s\_{1}^{\*}\in\{0,\cdots,8\}$, and given a $s\_{1}^{\*}$, $s\_{2}^{\*}=8-s\_{1}^{\*}$. I guess the notation $s1>s^{\*}$is confusing, it should mean that given a fixed $s\_{1}^{\*}$, if p1 deviates to $s\_{1}<s\_{1}^{\*}$, then p2's best response is to increase his number from $s\_{2}^\*$ to $s\_2$ and make $s\_2+s\_1=8$ again.

> **Comments:**
> **username_1**: You've listed only the equilibria that occur in the static version of the game. In the sequential version, player 2's strategy set is more complex than $\{0,1,...,8\}$, and hence there are more equilibria than just those you mentioned. Take a look at my solution below.  
> **username_2**: @username_1 You are right, I didn't read the question very carefully, sorry about that.  

---

