Keshav Ranjan
Postdoctoral Researcher at CMI
Research Interests: Graph Algorithms | Matchings under Preferences | Fair Division | ComSoc
Keshav Ranjan
Postdoctoral Researcher at CMI
Research Interests: Graph Algorithms | Matchings under Preferences | Fair Division | ComSoc
I am currently a postdoctoral researcher at Chennai Mathematical Institute, working with Prof. Prajakta Nimbhorkar.
I completed my Ph.D. from the Department of Computer Science and Engineering, IIT Madras, under the supervision of Dr. Meghana Nasre. My Ph.D. thesis, "Two-Sided Matchings: Lower Quotas, Ties, and Capacity Augmentation", was defended on July 02, 2025, and is available here.
My research interests lie in the broad area of Graph Algorithms, with a particular focus on matching problems with preferences — a foundational topic in market design that falls within the interdisciplinary field of Computational Social Choice. Beyond matching, I have recently begun exploring Fair Division, with a focus on algorithmic and structural questions surrounding envy-free allocations of indivisible goods — including notions such as EF1 (envy-freeness up to one good) and PROP1 (proportionality up to one good). Looking ahead, I am keen to broaden my work further across the computational social choice landscape.