<p>Though a bit unconventional to assume an infinitely repeated game without discounting, the short answer to your question is: yes. Any sequence of stage game Nash Equilibria is supportable as a SPNE. See, for example <a href="http://econ.ucsb.edu/~garratt/Econ171/Lect012_Slides.pdf" rel="nofollow noreferrer">slide 11 of this deck</a>, or <a href="https://web.stanford.edu/~jdlevin/Econ%20203/RepeatedGames.pdf" rel="nofollow noreferrer">these notes from Levin, starting on page 6</a>. This is more <a href="http://www.columbia.edu/~mh2245/GT_notes05.pdf#page=145" rel="nofollow noreferrer">directly addressed by the definition of SPNEs, found on page 137, Definition 132 of these notes</a>. Or where those Columbia notes suggest on page 142: "For example if there are multiple Nash equilibria in any of the final subgames then there are multiple sub game perfect Nash equilibria in the game itself"</p>

<p>Though you should note that, given your problem's construction (with no discounting), the set of SPNEs grows substantially, <a href="https://ocw.mit.edu/courses/economics/14-126-game-theory-spring-2016/lecture-notes/MIT14_126S16_Repeated.pdf" rel="nofollow noreferrer">as you can see.</a></p>

CC BY-SA 4.0
2018-05-27T07:33:48.227Z
It is [not that unconventional](https://en.wikipedia.org/wiki/Folk_theorem_(game_theory)#Infinitely-repeated_games_without_discounting) to assume no discounting.
Giskard
CC BY-SA 4.0
2018-05-27T07:36:12.243Z
I also edited one of your links. If you put "#page=145" after the URL of a pdf the link will just jump to that page.
Giskard
CC BY-SA 4.0
2018-05-27T17:48:44.170Z
Thank you so much for both of your help. That helps me a lot. Not only like three action PD game, but also like the hawk-dove game, any game with multiple NE. I am able to say that as long as stage nash is being played on the equilibrium path, then those kinds of strategies are SPNE.
Chuang Li
CC BY-SA 4.0
2018-05-27T00:55:38.840Z
2018-05-27T07:36:23.633Z
2018-05-27T07:36:23.633Z
AndrewC
<p>Given the game like Prisoner's dilemma (infinitely undiscounted) and each person has 3 actions in every period: confess defect and kill, and the payoff matrix have 2 NE as (D,D),(K,K).</p>

<p>Can I still use the property that if in any stage NE is played, then that kind of strategy is SPNE.</p>

<p>It seems work for me to prove that any sequence like dd,kk,kk,kk,dd....randomly combination of dd,kk, is SPNE.</p>

<p>Is that correct? Can I generalize that property?</p>

CC BY-SA 4.0
2018-05-26T15:51:47.713Z
How do you ensure convergence of payoff if the stage game is infinitely *un*discounted?
Herr K.
CC BY-SA 4.0
2018-05-26T18:24:27.600Z
Thanks for your asking. It's my bad that not state clear. I am assuming facing discounting factor as 1 and here we use average payoff instead of discounted future value. comparing the average payoff solving that the payoff is not converge
Chuang Li
<game-theory><repeated-games>
Repeated game with stage game has more than 1 NE
Chuang Li
# Repeated game with stage game has more than 1 NE

(Asked by: username_0 on 2018-05-26)

Given the game like Prisoner's dilemma (infinitely undiscounted) and each person has 3 actions in every period: confess defect and kill, and the payoff matrix have 2 NE as (D,D),(K,K).

Can I still use the property that if in any stage NE is played, then that kind of strategy is SPNE.

It seems work for me to prove that any sequence like dd,kk,kk,kk,dd....randomly combination of dd,kk, is SPNE.

Is that correct? Can I generalize that property?

**Tags:** game-theory, repeated-games

> **Comments:**
> **username_1**: How do you ensure convergence of payoff if the stage game is infinitely *un*discounted?  
> **username_0**: Thanks for your asking. It's my bad that not state clear. I am assuming facing discounting factor as 1 and here we use average payoff instead of discounted future value. comparing the average payoff solving that the payoff is not converge  

---

## 1 answers

### Answer by username_2 on 2018-05-27. Score: 1

Though a bit unconventional to assume an infinitely repeated game without discounting, the short answer to your question is: yes. Any sequence of stage game Nash Equilibria is supportable as a SPNE. See, for example [slide 11 of this deck](http://econ.ucsb.edu/~garratt/Econ171/Lect012_Slides.pdf), or [these notes from Levin, starting on page 6](https://web.stanford.edu/~jdlevin/Econ%20203/RepeatedGames.pdf). This is more [directly addressed by the definition of SPNEs, found on page 137, Definition 132 of these notes](http://www.columbia.edu/~mh2245/GT_notes05.pdf#page=145). Or where those Columbia notes suggest on page 142: "For example if there are multiple Nash equilibria in any of the final subgames then there are multiple sub game perfect Nash equilibria in the game itself"

Though you should note that, given your problem's construction (with no discounting), the set of SPNEs grows substantially, [as you can see.](https://ocw.mit.edu/courses/economics/14-126-game-theory-spring-2016/lecture-notes/MIT14_126S16_Repeated.pdf)

> **Comments:**
> **username_3**: It is [not that unconventional](https://en.wikipedia.org/wiki/Folk_theorem_(game_theory)#Infinitely-repeated_games_without_discounting) to assume no discounting.  
> **username_3**: I also edited one of your links. If you put "#page=145" after the URL of a pdf the link will just jump to that page.  
> **username_0**: Thank you so much for both of your help. That helps me a lot. Not only like three action PD game, but also like the hawk-dove game, any game with multiple NE. I am able to say that as long as stage nash is being played on the equilibrium path, then those kinds of strategies are SPNE.  

---

