Hi, I’m Eshwar, a first year PhD student in  the Department of Computer and Information Science at the University of Pennsylvania.

I work in theoretical computer science. I am interested in algorithms and complexity, particularly algorithmic game theory and graph algorithms. Here is my CV.

Previously, I was an intern at the Indian Institute of Science, Bangalore where I explored the algorithmic aspects of fair division with Prof. Siddharth Barman. Prior to this internship, I received an undergraduate degree in computer science from BITS Pilani in January 2018.

Link to my University webpage

 

Publications

  1. Fully Polynomial Time Approximation Schemes for Fair Rent Division (SODA 2019) – work done with Prof. Siddharth Barman and Nidhi Rathi
  2. Fair Division with a Secretive Agent (AAAI 2019) – work done with Prof. Siddharth Barman and Nidhi Rathi
  3. Fair and Efficient Cake Division with Connected Pieces (WINE 2019) –  with Prof. Siddharth Barman, Rachitesh Kumar and Nidhi Rathi

 

You can find a collection of my papers, drafts, thesis and reports here.

Please do get in touch with me at eshwarram.arunachaleswaran@gmail.com if you find  my work interesting and wish to discuss.