Sanath Kumar Krishnamurthy

Hello, I am Sanath, a first-year PhD student in Operations Research at Stanford. I am interested in problems at the intersection of economics and computer science. Recently, I have been exploring more of bandits and reinforcement learning.

Before joining Stanford, I got my BSc in Mathematics and Computer Science (2013-2016) and MSc Computer Science (2016-2018) from Chennai Mathematical Institute (CMI).

Links to my: CV, and Google scholar page. Short survey/overview: on fixed-point theorems (link), and on bandit algorithms (link).

Research Papers:

  • On the Proximity of Markets with Integral Equilibria [arXiv]

With Siddharth Barman

AAAI, 2019.

  • Finding Fair and Efficient Allocations [arXiv]

With Siddharth Barman and Rohit Vaish

EC, 2018.

  • Greedy Algorithms for Maximizing Nash Social Welfare [arXiv]

With Siddharth Barman and Rohit Vaish

AAMAS, 2018 (nominated for best paper).

  • Groupwise Maximin Fair Allocation of Indivisible Goods [arXiv]

With Siddharth Barman, Arpita Biswas, and Y. Narahari

AAAI, 2018.

  • Approximation Algorithms for Maximin Fair Division [arXiv]

With Siddharth Barman

EC, 2017.

Grant acknowledgements:

  • As a recipient of a School of Engineering fellowship, I am thankful to the Akiko Yamazaki and Jerry Yang Engineering Fellowship Fund for funding the first year of my PhD.
  • I am thankful to CMI's MSc scholarship and the Inspire's BSc scholarship for funding my education and stay at CMI.
  • I am grateful to Google India travel grant for funding my travel to EC 2017 and EC 2018.