Rahul Savani
Script error: No such module "Draft topics". Script error: No such module "AfC topic".
Rahul Savani is a Professor of Computer Science at the University of Liverpool, specialising in Algorithms and Complexity, Algorithmic Game Theory, and Automated Trading. He is also a Visiting Researcher at the Alan Turing Institute..[1]
Savani obtained his PhD in Mathematics at the London School of Economics in 2006, under the supervision of Bernhard von Stengel (von Stengel was, in turn, was supervised by Edsger W. Dijkstra) [2]. He has an Erdős number of 2 via David Avis.
Savani's research includes work on the complexity of gradient descent, which won a Best Paper Award at STOC 2021, which will be presented as an invited talk at the 2022 edition of The Highlights of Algorithms conference [3], and which has been covered in the popular science press [4]. His other work includes game-theoretic insights into multi-agent systems[5], and work that resolved the complexity of running the simplex algorithm with Dantzig's pivot rule and the Lemke–Howson algorithm.[6][7] He provides a web solver for bimatrix games [8]
Savani won the Penn-Lehman automated trading competition in 2004 [9]. In 2016 he was the Programme Co-Chair of the Symposium on Algorithmic Game Theory [10]; since 2017 he has been a co-editor for the International Journal of Game Theory International Journal of Game Theory). In 2022 is a Programme Co-Chair of the 3rd ACM Conference on AI in Finance [11].
References[edit]
- ↑ "Short bio". cgi.csc.liv.ac.uk.
- ↑ Science, London School of Economics and Political. "Bernhard von Stengel". London School of Economics and Political Science.
- ↑ Science, London School of Economics and Political. "Highlights of Algorithms 2022". London School of Economics and Political Science.
- ↑ Thieme, Nick (2021-08-17). "Computer Scientists Discover Limits of Major Research Algorithm". Quanta Magazine. Retrieved 2022-05-16.
- ↑ "Game-theory insights into asymmetric multi-agent games". www.deepmind.com.
- ↑ Fearnley, John; Savani, Rahul (June 14, 2015). "The Complexity of the Simplex Method". Association for Computing Machinery. pp. 201–208. doi:10.1145/2746539.2746558 – via ACM Digital Library.
- ↑ "2014 in algorithm preprints". 11011110.github.io.
- ↑ "Solve a Bimatrix Game". cgi.csc.liv.ac.uk. Retrieved 2022-05-16.
- ↑ "THE PENN-LEHMAN AUTOMATED TRADING PROJECT: 2004-05". www.cis.upenn.edu.
- ↑ editor., Gairing, Martin, editor. Savani, Rahul. Algorithmic Game Theory : 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21, 2016, Proceedings. ISBN 978-3-662-53354-3. OCLC 1008646579.CS1 maint: Extra text: authors list (link) Search this book on
- ↑ "ICAIF'22". ICAIF'22. Retrieved 2022-05-16.
This article "Rahul Savani" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Rahul Savani. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
