All Stories

  1. The Complexity of Computing KKT Solutions of Quadratic Programs

    Article • Journal of the ACM, June 2025, ACM (Association for Computing Machinery)

    Rahul Savani

  2. Monotone Contractions

    Article • June 2025, ACM (Association for Computing Machinery)

    Rahul Savani

  3. Market Making with Learned Beta Policies

    Article • November 2024, ACM (Association for Computing Machinery)

    Rahul Savani

  4. The Effect of Liquidity on the Spoofability of Financial Markets

    Article • November 2024, ACM (Association for Computing Machinery)

    Rahul Savani

  5. The Complexity of Computing KKT Solutions of Quadratic Programs

    Article • June 2024, ACM (Association for Computing Machinery)

    Rahul Savani

  6. Conditional Generators for Limit Order Book Environments: Explainability, Challenges, and Robustness

    Article • November 2023, ACM (Association for Computing Machinery)

    Rahul Savani, Joseph Jerome

  7. Mbt-gym: Reinforcement learning for model-based limit order book trading

    Article • November 2023, ACM (Association for Computing Machinery)

    Joseph Jerome, Rahul Savani

  8. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS

    Article • Journal of the ACM, December 2022, ACM (Association for Computing Machinery)

    Rahul Savani

  9. Market Making with Scaled Beta Policies

    Article • October 2022, ACM (Association for Computing Machinery)

    Rahul Savani, Joseph Jerome

  10. A Faster Algorithm for Finding Tarski Fixed Points

    Article • ACM Transactions on Algorithms, July 2022, ACM (Association for Computing Machinery)

    Rahul Savani

  11. Selective classification for trading strategy design

    Article • November 2021, ACM (Association for Computing Machinery)

    Rahul Savani, Nestoras Chalkidis

  12. The complexity of gradient descent: CLS = PPAD ∩ PLS

    Article • June 2021, ACM (Association for Computing Machinery)

    Rahul Savani

  13. Unique end of potential line

    Article • Journal of Computer and System Sciences, December 2020, Elsevier

    Rahul Savani

  14. One-Clock Priced Timed Games are PSPACE-hard

    Article • May 2020, ACM (Association for Computing Machinery)

    Rahul Savani

  15. Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games

    Article • Mathematics of Operations Research, August 2019, INFORMS

    Rahul Savani

  16. Evolving indoor navigational strategies using gated recurrent units in NEAT

    Article • July 2019, ACM (Association for Computing Machinery)

    Rahul Savani

  17. Inapproximability results for constrained approximate Nash equilibria

    Article • Information and Computation, October 2018, Elsevier

    Rahul Savani

  18. Distributed Methods for Computing Approximate Equilibria

    Article • Algorithmica, June 2018, Springer Science + Business Media

    Rahul Savani

  19. Preface to the Special Issue on Algorithmic Game Theory

    Article • Theory of Computing Systems, June 2018, Springer Science + Business Media

    Rahul Savani

  20. Space Debris Removal: Learning to Cooperate and the Price of Anarchy

    Article • Frontiers in Robotics and AI, June 2018, Frontiers

    Rahul Savani

  21. Symmetric Decomposition of Asymmetric Games

    Article • Scientific Reports, January 2018, Springer Science + Business Media

    Rahul Savani

  22. Computing Constrained Approximate Equilibria in Polymatrix Games

    Article • January 2017, Springer Science + Business Media

    Rahul Savani

  23. LiftUpp: Support to Develop Learner Performance

    Article • January 2017, Springer Science + Business Media

    Rahul Savani

  24. Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries

    Article • ACM Transactions on Economics and Computation, August 2016, ACM (Association for Computing Machinery)

    Rahul Savani

  25. Space Debris Removal: A Game Theoretic Analysis

    Article • Games, August 2016, MDPI AG

    Rahul Savani

  26. Unit vector games

    Article • International Journal of Economic Theory, January 2016, Wiley

    Rahul Savani

  27. Distributed Methods for Computing Approximate Equilibria

    Article • January 2016, Springer Science + Business Media

    Rahul Savani

  28. Inapproximability Results for Approximate Nash Equilibria

    Article • January 2016, Springer Science + Business Media

    Rahul Savani

  29. Computing Approximate Nash Equilibria in Polymatrix Games

    Article • Algorithmica, October 2015, Springer Science + Business Media

    Rahul Savani

  30. Approximate Well-supported Nash Equilibria Below Two-thirds

    Article • Algorithmica, July 2015, Springer Science + Business Media

    Rahul Savani

  31. The Complexity of the Simplex Method

    Article • June 2015, ACM (Association for Computing Machinery)

    Rahul Savani

  32. An Empirical Study of Finding Approximate Equilibria in Bimatrix Games

    Article • January 2015, Springer Science + Business Media

    Rahul Savani

  33. Game Theory Explorer: software for the applied game theorist

    Article • Computational Management Science, April 2014, Springer Science + Business Media

    Rahul Savani

  34. Finding approximate nash equilibria of bimatrix games via payoff queries

    Article • January 2014, ACM (Association for Computing Machinery)

    Rahul Savani

  35. Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3

    Article • January 2013, Springer Science + Business Media

    Rahul Savani

  36. On the approximation performance of fictitious play in finite games

    Article • International Journal of Game Theory, December 2012, Springer Science + Business Media

    Rahul Savani

  37. High-Frequency Trading: The Faster, the Better?

    Article • IEEE Intelligent Systems, July 2012, Institute of Electrical & Electronics Engineers (IEEE)

    Rahul Savani

  38. Approximate Well-Supported Nash Equilibria Below Two-Thirds

    Article • January 2012, Springer Science + Business Media

    Rahul Savani

  39. The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions

    Article • October 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Rahul Savani

  40. On the Approximation Performance of Fictitious Play in Finite Games

    Article • January 2011, Springer Science + Business Media

    Rahul Savani

  41. Computing Stable Outcomes in Hedonic Games

    Article • January 2010, Springer Science + Business Media

    Rahul Savani

  42. Linear Complementarity Algorithms for Infinite Games

    Article • January 2010, Springer Science + Business Media

    Rahul Savani

  43. Enumeration of Nash equilibria for two-player games

    Article • Economic Theory, March 2009, Springer Science + Business Media

    Rahul Savani

  44. Power Indices in Spanning Connectivity Games

    Article • January 2009, Springer Science + Business Media

    Rahul Savani

  45. Wiretapping a Hidden Network

    Article • January 2009, Springer Science + Business Media

    Rahul Savani

  46. Good neighbors are hard to find: computational complexity of network formation

    Article • Review of Economic Design, March 2008, Springer Science + Business Media

    Rahul Savani

  47. Hard-to-Solve Bimatrix Games

    Article • Econometrica, March 2006, The Econometric Society

    Rahul Savani

  48. Mixed-species aggregations in birds: zenaida doves, Zenaida aurita, respond to the alarm calls of carib grackles, Quiscalus lugubris

    Article • Animal Behaviour, September 2005, Elsevier

    Rahul Savani

  49. A Simple P-Matrix Linear Complementarity Problem for Discounted Games

    Article • Springer Science + Business Media

    Rahul Savani