My research is in the general area of theoretical computer science, particularly the areas of approximation algorithms, online algorithms, and computational economics. I work on developing models, algorithms, and markets for resource allocation, decision making, and provisioning problems. These problems arise in a variety of applications -- designing a data network, facility location and clustering, data center scheduling, allocating ad slots, scheduling ride-shares, and civic budgeting. In these contexts, my work has addressed several research challenges pertaining to computing efficient solutions, handling uncertainty in future inputs, pricing and incentives when allocating to selfish agents, and fairness.
My recent work has focused on two aspects:
Persuading an optimizer or learner towards certain objectives via information revelation and pricing.
Fairness to groups based on proportionality and stability in resource allocation and societal decision making contexts.
A complete list of my papers is available on DBLP and on Google Scholar. See here for more papers and projects.
Combinatorial optimization via LLM-driven iterated fine-tuning.
Fair division via the cake-cutting share. AAAI '25
Group fairness and multi-criteria optimization in school assignment. FORC '25
Differential privacy with multiple selections. FORC '25 (empirical companion)
Fair price discrimination. SODA '24
Please see here for a complete list of courses.
Spring '25, '20: CPS 630: Randomized Algorithms
Fall '24, Fall '21: CPS 330: Algorithm Design
Spring '24: CPS535: Algorithmic Game Theory
Fall '23: CPS 531: Algorithm Design
Spring '23, '21: CPS 230: Discrete Mathematics
Fall '20: CPS 532: Graduate Algorithms
Spring '19: CPS590: Algorithms for Decision making at Scale
D205, Levine Science Research Center,
308 Research Drive, Durham NC 27708-0129.
Phone: (919) 660-6598
Email address: <first_name> @cs.duke.edu