Skip to content

Instantly share code, notes, and snippets.

@cc7768

cc7768/RepeatedGamesNotebook.ipynb

Created November 9, 2016 19:27
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save cc7768/cbc9cddd15a49630d30ad2e45bfcb739 to your computer and use it in GitHub Desktop.
Save cc7768/cbc9cddd15a49630d30ad2e45bfcb739 to your computer and use it in GitHub Desktop.
Download ZIP
Display the source blob
Display the rendered blob
Raw
RepeatedGamesNotebook.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
@oyamad
Copy link

oyamad commented Nov 10, 2016

The statement "The monotonicity of B means that ..." is not precise enough. (For example, the identity mapping, the mapping defined by B(V) = V for any V, is monotone, but iteration of it does not converge to the set of SPE payoff profiles.)

@oyamad
Copy link

oyamad commented Nov 11, 2016

Other (minor) comments I typed yesterday but which disappeared:

  • In Step 2, (1 - delta) is missing in the IC constraints.
  • In Step 2, the last two two elements in b should be the right hand side of the second inequality in 3). Delete the ) after underline_w_i there.
  • The pictures would look better if drawn with equal aspect ratio.
  • Maybe better to connect the vertices in the pictures of the payoff profile sets.

@oyamad
Copy link

oyamad commented Nov 11, 2016

  • max_x c^T x should be min_x c^T x: in the code, the linear program is set up as a minimization problem.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment