I’m a second-year PhD student in Computer Science at Cornell University, advised by Prof. Éva Tardos and Prof. Jon Kleinberg. My interests are broadly in theoretical computer science, particularly algorithmic game theory, mechanism design, and networks. Currently, I’m working on generalizing submodularity to ordered sequences and lists, with applications in diversification of recommender systems.
Previously, I graduated from Princeton University with an A.B. in Chemistry and minors in Applied Math and Computer Science, where I worked with Prof. Matt Weinberg on Bayesian auction design for multi-item revenue maximization. I also wrote my senior thesis in physical organic chemistry under the supervision of Prof. Robert Knowles.
Non-academic interests (many starting with a C, some supported by images): caffeine, cats, colouring-of-hair, crafting, dance, yoga
PhD in Computer Science, present
Cornell University
A.B. in Chemistry with minors in Applied Math & Computer Science, 2017-2021
Princeton University
We study calibrated recommendations for users whose attention decays over the course of a ranked list, meaning that not all recommended items receive equal consideration. For a distributional model of genres, we extend tools from submodular optimization to provide a $(1-1/e)$-approximation algorithm to calibration. For a discrete model of genres, we show that the natural greedy algorithm is a $2/3$-approximation. Our work thus addresses the problem of capturing ordering effects due to decaying attention, allowing for the extension of near-optimal calibration from recommendation sets to recommendation lists.
(This paper incorporates and supersedes our earlier paper on ordered submodularity.)