Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
E CONOMICS S-1050 H ARVARD U NIVERSITY S UMMER 2009 S UMMER S CHOOL P ROBLEM S ET 4 A NSWERS due July 30 , in class Show all calculations, explain all answers (up to 5 lines), and fully label graphs. Also: (a) staple sheets, (b) acknowledge assistance, (c) highlight final answers, and (d) write neatly! 1. Axelrod’s Tournament: - 2.0 - Build a finite automaton (using the least number of states) for the following strategies: a) Start with D. Play C if both played C or both played D in the previous period; otherwise play D. b) Start with C. Play C as long as the other does. If the other plays D, play D for exactly three periods and then return to playing C. c) Start with playing D twice. Play C only if the other has played C in each of the last two periods. d) Start with C. Then play whatever the other played in the previous period.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
- 2.0 - 2. Assume a population composed of an equal number of each of the strategies given above. They are then matched in pairs and play IRPD with payoffs: T = 5, R = 3, P = 1, S = 0.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4


This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online