Erdös Number: 2 ( Paul Erdös --1-> David Avis --2-> Rahul Savani )
Refereed journal articles:
-
P. W. Goldberg, C. H. Papadimitriou, and R. Savani (2011),
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson
Solutions.
Accepted to: ACM Transactions on Economics and Computation.
Preliminary version: IEEE Symposium on Foundations of Computer Science (FOCS).
Full version: http://arxiv.org/abs/1006.5352.
-
D. Avis, G. Rosenberg, R. Savani , and B. von Stengel (2010),
Enumeration of Nash Equilibria for
Two-Player Games.
Economic Theory 42, 9-37.
-
R. Baron, J. Durieu, H. Haller, R. Savani, and P. Solal (2008),
Good Neighbors are Hard to Find.
Review of Economic Design 12, 1-19.
-
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.
Animal Behaviour 70, 507-515.
Refereed conference papers:
-
P. W. Goldberg, C. H. Papadimitriou, and R. Savani (2011),
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson
Solutions.
IEEE Symposium on Foundations of Computer Science (FOCS).
Full version: http://arxiv.org/abs/1006.5352.
-
P. W. Goldberg, R. Savani, T. B. Sørensen, C. Ventre (2011),
On the Approximation Performance of Fictitious Play in Finite Games.
European Symposium on Algorithms (ESA).
Full version: http://arxiv.org/abs/1103.1040.
-
M. Gairing and R. Savani (2011),
Computing stable outcomes in hedonic games with voting-based deviations.
International Conference on Autonomous Agents and Multiagent Systems (AAMAS).
-
M. Gairing and R. Savani (2010),
Computing stable outcomes in hedonic games.
International Symposium on Algorithmic Game Theory (SAGT), 174-185.
-
J. Fearnley, M. Jurdziński, and R. Savani (2010),
Linear complementarity algorithms for infinite games.
International Conference on Current Trends in Theory & Practice of Computer Science (SOFSEM), 382-393.
Full version: http://arxiv.org/abs/0909.5653
-
H. Aziz, O. Lachish, M. Paterson, and R. Savani (2009),
Wiretapping a hidden network.
Workshop on Internet & Network Economics (WINE), 438-446.
Full version: http://arxiv.org/abs/0909.5293
-
H. Aziz, O. Lachish, M. Paterson, and R. Savani (2009),
Power indices for spanning connectivity games.
Algorithmic Aspects in Information & Management
(AAIM), 55-67.
Full version: http://arxiv.org/abs/0906.3643
-
M. Jurdziński and R. Savani (2008),
A simple P-matrix linear complementarity problem for
discounted games.
Computability in Europe (CiE), 283-293.
-
R. Savani and B. von Stengel (2004), Exponentially
Many Steps for Finding a Nash Equilibrium in a Bimatrix
Game.
In: Proc. 45th IEEE Symposium on Foundations of Computer Science (FOCS), 258-267
(SLIDES;
CDAM
Research Report LSE-CDAM-2004-03).
Other publications: