Authors: Chase Coleman with Thomas Sargent
This notebook describes Julia code that implements an algorithm for computing equilibrium values and associated equilibrium strategy profiles for repeated games with $N$ players and finite actions.
The code builds on ideas of Abreu, Pearce, Stachetti (1986, 1990).
It uses a numerical algorithm called the outer hyperplane approximation algorithm invented by Judd, Yeltekin, Conklin (2003).
We focus on a particularly simple example, namely, a repeated prisoner's dilemma.
Our friends Timothy Hills and Ben Tengelsen provided useful comments about detailed aspects of the algorithm.
Games library is currently under development and not yet a published Julia package
To get it, please run
This command may also install some additional packages such as
CDDLib (and whatever dependencies these packages rely on).
Plotting in this notebook uses the package
A cautionary note: occasionally (but not always) users of this notebook have experienced difficulty installing
Polyhedra (sometimes due to no fault of their own).
This, the first version of this notebook, uses the following versions of various packages:
Please verify that you have the correct versions of these packages [1, 2].
We have found that occasionally users have struggled to get
CDDLib to build.
If this happens to you, make sure that you have libgmp installed. After it has been installed, please run
If you encounter problems beyond these, please raise an issue about them in the package's repository or in the QuantEcon.notebooks repository.
 You can do this by creating a dictionary
d = Pkg.installed() and then looking at version associated with
 You can specify that you'd like to download a particular version of a package with
Pkg.add("PackageName", v"x.y.z") where
x.y.z refers to the version number (Note that the
v is before the quotations on purpose).
 On an Ubuntu machine, you can do this with
sudo apt-get install libgmp-dev
using Games using PlotlyJS