I've moved. Here is my new homepage.
Rahul Savani
Department of Mathematics
Research Student
LSE Tel: 020 7955 6374
Email: r.s.savani@lse.ac.uk
Research Interests:
Game Theory, Algorithms, Automated Trading.
Lecturing:
I am curently an Associate Lecturer in the Computer Science Department at the University of Leicester.
I teach CO7212: Game Theory in Computer Science.
Class Teaching:
MA300 Game Theory
MA314 Theory of Algorithms
Publications:
R. Savani and B. von Stengel (2006), Hard-to-Solve Bimatrix Games. Econometrica 74, 397-429.
A. S. Griffin, R. Savani, K. Hausmanis, and L. Lefebvre (2005), Mixed-species aggregations in birds: zenaida doves, Zenaida aurita, respond to the alarm calls of carib grackles, Quiscalus lugubris. Animal Behaviour 70:3, 507-515.
R. Savani and B. Veal (2005), A novel strategy for the Penn-Lehman automated trading competition. CDAM Research Report LSE-CDAM-2005-12.
R. Savani (2004), Challenge Instances for NASH. CDAM Research Report LSE-CDAM-2004-14.
R. Savani and B. von Stengel (2004), Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. In: Proc. 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 258-267. (SLIDES)
R. Savani and B. von Stengel (2004), Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. CDAM Research Report LSE-CDAM-2004-03.
Other Stuff: I participated in the 2005 Penn-Lehman automated trading (PLAT) competition with Ben Veal. We won the May 2005 competition and came second in the December 2004 competition. (See here)