00:02
This game is a version of the prisoner's dilemma.
00:06
We have suspect 1 here with fink and silent, suspect 2 here also with fink and silent.
00:11
So when suspect 1 plays fink and suspect 2 plays fink, it's 0.
00:16
When suspect 1 plays fink and suspect 2 plays silent, we have 3 negative 1.
00:20
When suspect 1 plays silent and suspect 2 plays fink, we have negative 1 3.
00:25
And when suspect 1 plays silent and suspect 2 plays silent, we're at 1 -1.
00:32
We're going to verify that the next number.
00:34
Nash equilibrium is the usual one for the prisoner's dilemma and that both players have a dominant strategy.
00:39
And we're going to suppose that this stage game is repeated infinitely many times.
00:46
There are two players in the given game, suspect one and suspect two.
00:50
Each player has two strategies, fink and silent.
00:54
It is required that both the players have dominant strategies and the nash equilibrium is the usual one for the prisoner's dilemma.
01:02
When suspect one plays fink, then suspect two gets a payoff of zero from fink and negative one from silent...