Published 'Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation' in Operations Research
Published 'On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources' at APPROX 2021, proposing the top-trading envy cycle algorithm to guarantee EF1
Published 'Stable Fractional Matchings' at EC 2019 and in Artificial Intelligence, studying fractional stable matchings under cardinal preferences
AAMAS 2018 Best Paper Nominee: 'Greedy Algorithms for Maximizing Nash Social Welfare'—a polynomial-time algorithm for binary valuations
Published 'Finding Fair and Efficient Allocations' at EC 2018, providing an algorithmic framework for EF1 + PO allocations and a 1.45-approximation for Nash social welfare
Published 'Opting Into Optimal Matchings' at SODA 2017, analyzing kidney exchange under a semi-random model
Published 'Manipulating Gale-Shapley Algorithm: Preserving Stability and Remaining Inconspicuous' at IJCAI 2017, showing optimal manipulation is stability-preserving and inconspicuous
Background
Assistant Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Delhi
Associate faculty at Yardi School of Artificial Intelligence
Member of the Theoretical Computer Science group at IIT Delhi
Research focuses on computational social choice—the study of collective decision-making from a computational perspective
Interested in problems at the interface of economics and computer science