The folk theorem
1.[2p] What does the folk theorem say about the infinitely repeated game?
What does the folk theorem say about the infinitely repeated game?
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?
What is a player's minmax value?
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?
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?
4.[2p] Allowing the punishing players to randomise can lower a player's minmax value below what any pure punishment achieves.
Allowing the punishing players to randomise can lower a player's minmax value below what any pure punishment achieves.
The answer is: True
5.[2p] In the prisoner's dilemma with , , , , what is each player's minmax value?
In the prisoner's dilemma with , , , , what is each player's minmax value?
6.[3p] Why is the folk theorem a problem rather than a triumph?
Why is the folk theorem a problem rather than a triumph?
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?
Which of these were true of tit for tat in Axelrod's tournaments?
Select all that apply
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, , , , , what does tit for tat score against unconditional defection over 200 rounds?
With Axelrod's scoring, , , , , what does tit for tat score against unconditional defection over 200 rounds?
9.[2p] Match each strategy or result to what it does.
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