There is one piece of assessment in this course:

• A 2 hour exam (100%)

Exam (100%)

You can find:

• an example exam here with solutions here.
• a mock exam (that we will work through in class) here with solutions here.

List of examinable theorems and proofs

1. Best Response condition and proof.
2. Existence of Nash equilibrium in games of perfect information and proof.
3. Subgame perfection of sequence of stage Nash equilibrium and proof.
4. Folk Theorem and proof.
5. Characterisation of ESS in two player games and proof.
6. The fixation probabilities in populations of two types and proof.
7. Nash Flow minimises the potential function (statement only, the proof is not examinable).
8. Optimal Flow is a Nash Flow for Marginal Costs (statement only, the proof is not examinable).
9. Unique matching as output of the Gale Shapley algorithm and proof.
10. Reviewer sub optimality of the Gale Shapley Algorithm and proof.
11. Bayesian Nash Equilibrium for Second Pay Auction and proof.
12. Bayesian Nash equilibrium in a first-price auction with uniform values and proof.
13. Revenue Equivalence (statement and conditions only, the proof is not examinable).