Rahul Savani
Rahul Savani
Professor of Computer Science, University of Liverpool
Verified email at liverpool.ac.uk - Homepage
TitleCited byYear
Exponentially many steps for finding a Nash equilibrium in a bimatrix game
R Savani, B von Stengel
Foundations of Computer Science (FOCS), 2004. Proceedings. 45th Annual IEEE …, 2004
Hard‐to‐Solve Bimatrix Games
R Savani, B von Stengel
Econometrica 74 (2), 397-429, 2006
Enumeration of Nash equilibria for two-player games
D Avis, GD Rosenberg, R Savani, B von Stengel
Economic Theory 42 (1), 9-37, 2010
Hedonic games
H Aziz, R Savani
Handbook of Computational Social Choice, 136-139, 2016
Computing stable outcomes in hedonic games
M Gairing, R Savani
International Symposium on Algorithmic Game Theory, 174-185, 2010
Mixed-species aggregations in birds: zenaida doves, Zenaida aurita, respond to the alarm calls of carib grackles, Quiscalus lugubris
AS Griffin, R Savani, K Hausmanis, L Lefebvre
Animal Behaviour 70 (3), 507-515, 2005
The complexity of the homotopy method, equilibrium selection, and Lemke-Howson solutions
PW Goldberg, CH Papadimitriou, R Savani
ACM Transactions on Economics and Computation 1 (2), 9, 2013
Lenient Multi-Agent Deep Reinforcement Learning
G Palmer, K Tuyls, D Bloembergen, R Savani
Proceedings of the 17th International Conference on Autonomous Agents and …, 2018
Power indices in spanning connectivity games
H Aziz, O Lachish, M Paterson, R Savani
International Conference on Algorithmic Applications in Management, 55-67, 2009
Learning equilibria of games via payoff queries
J Fearnley, M Gairing, PW Goldberg, R Savani
The Journal of Machine Learning Research 16 (1), 1305-1344, 2015
Approximate well-supported Nash equilibria below two-thirds
J Fearnley, PW Goldberg, R Savani, TB Sørensen
Algorithmica 76 (2), 297-319, 2016
A simple P-matrix Linear Complementarity Problem for Discounted Games
M Jurdziński, R Savani
Conference on Computability in Europe, 283-293, 2008
Game Theory Explorer: software for the applied game theorist
R Savani, B von Stengel
Computational Management Science 12 (1), 5-33, 2015
Distributed methods for computing approximate equilibria
A Czumaj, A Deligkas, M Fasoulakis, J Fearnley, M Jurdziński, R Savani
Algorithmica 81 (3), 1205-1231, 2019
The Complexity of the Simplex Method
J Fearnley, R Savani
47th ACM Symposium on Theory of Computing (STOC), 201-208, 2015
Inapproximability results for constrained approximate Nash equilibria
A Deligkas, J Fearnley, R Savani
Information and Computation 262, 40-56, 2018
Computing approximate Nash equilibria in polymatrix games
A Deligkas, J Fearnley, R Savani, P Spirakis
Algorithmica 77 (2), 487-514, 2017
Finding approximate Nash equilibria of bimatrix games via payoff queries
J Fearnley, R Savani
ACM Transactions on Economics and Computation (TEAC) 4 (4), 25, 2016
Cooperative max games and agent failures
Y Bachrach, R Savani, N Shah
Proceedings of the 2014 international conference on Autonomous agents and …, 2014
High-Frequency Trading: The Faster, the Better?
R Savani
Intelligent Systems, IEEE 27 (4), 70-73, 2012
The system can't perform the operation now. Try again later.
Articles 1–20