Combinatorial Optimization, Approximation Algorithms, Algorithmic Game Theory, Efficient Implementations
Synopsis. My research broadly focuses on the design of efficient algorithms for problems arising in the area of combinatorial optimization. I am particularly interested in NP-hard optimization problems for whom exact polynomial-time algorithms are unlikely to exist. For such problems, I develop approximation algorithms, i.e., fast algorithms that compute near-optimal solutions to given instances of NP-hard optimization problems. I am also interested in algorithmic game theory and its connections to combinatorial optimization.