Sign in

Libre University uses your GitHub account. Signing in is only needed to sit a final test, so the score is kept on your profile.

The folk theorem

1.[2p]

What does the folk theorem say about the infinitely repeated game?

Correct
The answer is: Every feasible payoff vector strictly above the minmax is an equilibrium payoff once players are patient enough
The answer is: Every feasible payoff vector strictly above the minmax is an equilibrium payoff once players are patient enough
The answer is: Every feasible payoff vector strictly above the minmax is an equilibrium payoff once players are patient enough

2.[3p]

What is a player's minmax value?

Correct
The answer is: The least the other players can hold them to when they best respond
The answer is: The least the other players can hold them to when they best respond
The answer is: The least the other players can hold them to when they best respond

3.[3p]

Player 1 earns 4 from row T against L and 0 against R, and 0 from row B against L and 3 against R. What is player 1's minmax value when player 2 may randomise?

CorrectNot quite: 1.71

4.[2p]

Allowing the punishing players to randomise can lower a player's minmax value below what any pure punishment achieves.

Correct
The answer is: True

5.[2p]

In the prisoner's dilemma with T=6, R=4, P=2, S=1, what is each player's minmax value?

CorrectNot quite: 2

6.[3p]

Why is the folk theorem a problem rather than a triumph?

Correct
The answer is: The set of equilibrium payoffs is so large that no observation could contradict the model
The answer is: The set of equilibrium payoffs is so large that no observation could contradict the model
The answer is: The set of equilibrium payoffs is so large that no observation could contradict the model

7.[3p]

Which of these were true of tit for tat in Axelrod's tournaments?

Select all that apply

Correct
Correct
Correct
Correct
The answer is: It won both tournaments on total score, It was the shortest program submitted, It never scored more than an opponent in a head-to-head match, It performs poorly when moves are occasionally misread

8.[3p]

With Axelrod's scoring, T=5, R=3, P=1, S=0, what does tit for tat score against unconditional defection over 200 rounds?

CorrectNot quite: 199

9.[2p]

Match each strategy or result to what it does.

  • Grim trigger

  • Generous tit for tat

  • Win-stay lose-shift

  • Zero-determinant

  • punishes any defection forever

  • fixes a ratio between the two scores

  • repeats a move that worked

  • forgives some defections at random

Show the answer

Grim trigger: punishes any defection forever Generous tit for tat: forgives some defections at random Win-stay lose-shift: repeats a move that worked Zero-determinant: fixes a ratio between the two scores