Rahul Savani
According to our database^{1},
Rahul Savani
authored at least 38 papers
between 2004 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2019
Preface to the Special Issue on Algorithmic Game Theory.
Theory Comput. Syst., 2019
Negative Update Intervals in Deep MultiAgent Reinforcement Learning.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
The Representational Capacity of ActionValue Networks for MultiAgent Reinforcement Learning.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
2018
Inapproximability results for constrained approximate Nash equilibria.
Inf. Comput., 2018
Space Debris Removal: Learning to Cooperate and the Price of Anarchy.
Front. Robotics and AI, 2018
Reachability Switching Games.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Market Making via Reinforcement Learning.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
Lenient MultiAgent Deep Reinforcement Learning.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
2017
Computing Constrained Approximate Equilibria in Polymatrix Games.
Proceedings of the Algorithmic Game Theory  10th International Symposium, 2017
LiftUpp: Support to Develop Learner Performance.
Proceedings of the Artificial Intelligence in Education  18th International Conference, 2017
2016
Hedonic Games.
Proceedings of the Handbook of Computational Social Choice, 2016
Inapproximability Results for Approximate Nash Equilibria.
Proceedings of the Web and Internet Economics  12th International Conference, 2016
Distributed Methods for Computing Approximate Equilibria.
Proceedings of the Web and Internet Economics  12th International Conference, 2016
The Complexity of Allswitches Strategy Improvement.
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Space Debris Removal: A Game Theoretic Analysis.
Proceedings of the ECAI 2016  22nd European Conference on Artificial Intelligence, 29 August2 September 2016, The Hague, The Netherlands, 2016
An Empirical Study on Computing Equilibria in Polymatrix Games.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
2015
Game Theory Explorer: software for the applied game theorist.
Comput. Manag. Science, 2015
An Empirical Study of Finding Approximate Equilibria in Bimatrix Games.
Proceedings of the Experimental Algorithms  14th International Symposium, 2015
The Complexity of the Simplex Method.
Proceedings of the FortySeventh Annual ACM on Symposium on Theory of Computing, 2015
2014
Equilibrium Computation (Dagstuhl Seminar 14342).
Dagstuhl Reports, 2014
Computing Approximate Nash Equilibria in Polymatrix Games.
Proceedings of the Web and Internet Economics  10th International Conference, 2014
A data rich money market model  agentbased modelling for financial stability.
Proceedings of the 4th International Conference On Simulation And Modeling Methodologies, 2014
Finding approximate Nash equilibria of bimatrix games via payoff queries.
Proceedings of the ACM Conference on Economics and Computation, 2014
Cooperative max games and agent failures.
Proceedings of the International conference on Autonomous Agents and MultiAgent Systems, 2014
Increasing VCG Revenue by Decreasing the Quality of Items.
Proceedings of the TwentyEighth AAAI Conference on Artificial Intelligence, 2014
2013
Polylogarithmic Supports Are Required for Approximate WellSupported Nash Equilibria below 2/3.
Proceedings of the Web and Internet Economics  9th International Conference, 2013
Learning equilibria of games via payoff queries.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
2012
HighFrequency Trading: The Faster, the Better?
IEEE Intelligent Systems, 2012
Approximate WellSupported Nash Equilibria Below TwoThirds.
Proceedings of the Algorithmic Game Theory  5th International Symposium, 2012
2011
The Complexity of the Homotopy Method, Equilibrium Selection, and LemkeHowson Solutions.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
On the Approximation Performance of Fictitious Play in Finite Games.
Proceedings of the Algorithms  ESA 2011, 2011
Computing stable outcomes in hedonic games with votingbased deviations.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011
2010
Linear Complementarity Algorithms for Infinite Games.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010
Computing Stable Outcomes in Hedonic Games.
Proceedings of the Algorithmic Game Theory  Third International Symposium, 2010
2009
Wiretapping a Hidden Network.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
Power Indices in Spanning Connectivity Games.
Proceedings of the Algorithmic Aspects in Information and Management, 2009
2008
A Simple PMatrix Linear Complementarity Problem for Discounted Games.
Proceedings of the Logic and Theory of Algorithms, 2008
2004
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004