[@ 3:30pm. 23 Feb, 2010. S9, Old CSE, 2nd floor]
Ruta Mehta
Toy problem: TODO
I will be talking about finite two player games, what Nash equilibrium mean for these games, and an algorithm to find a Nash equilibrium (Lemke-Howson) (http://www.stanford.edu/~saberi/lecture4.pdf). If time permites then I will also talk about the complexity class PPAD related to this algorithm.
No comments:
Post a Comment