Skip to content

Latest commit

 

History

History
19 lines (18 loc) · 2.48 KB

README.md

File metadata and controls

19 lines (18 loc) · 2.48 KB

Advanced Economic Theory 2016 A1

##First topic: Equilibrium Computation for Two-Player Games in Strategic Form

Part I Support Enumeration

Homework: write a homemade Python code to implement Support Enumeration Algorithm for computing the Nash Equilibra of Nondegenerate Two-Player Game. Support Enumeration

Part II Vertex Enumeration

Part III Lemke Howson

Homework: write a homemade Python code to implement Lemke Howson Algorithm for finding a Nash Equilibrium starting from atificial equilibrium (0,0).   lemke Howson   lemke Howson (integer pivoting)
lemke Howson (Enumeration)
lemke Howson (degenerate game) ##Second topic: From Imitation Games to Kakutani
From Imitation Games to Kakutani
Homework: Write your own code for the McLennan-Tourky algorithm in Python or Julia (or both) using your Lemke-Howson implementation, and run it for several example functions on a Jupyter notebook.
From Imitation to Kakutani

HW5 Experimental Analysis of Lemke Howson Algorithm
(see reference here)
In my codes, I use the lemke howson function from QuantEcon package by Oyama sensei. I change the source code in my computer so that the lemke howson function can return a bool variable that whether NE is achieved in limited steps and a integer variable that shows how many steps it use (if NE is not found, then the returned step number is exactly capping).