I graduated with my Ph.D. in Algorithms, Combinatorics, and Optimization from Carnegie Mellon University in May 2018. I am currently a postdoctoral researcher under Andrea Lodi at Polytechnique Montréal.
I am on the job market this year.
You can find more information about me and my recent research on my CV. Please feel free to contact me at my email address if you have any questions about my work.
Upcoming presentations:
- May 18-21, 2020: Mixed Integer Programming Workshop, DIMACS, Rutgers University, NJ.
Older news: In 2014, I founded the INFORMS Student Chapter at CMU. Visit the CMU INFORMS site or join the mailing list for more information and details about past/upcoming talks in our student seminar. The chapter has been recognized several times by INFORMS for its activities. I was also the founding chair of the YinzOR Student Conference at Carnegie Mellon.
Research
My research focuses on methodology and applications for discrete decision analytics. In particular, I work on developing new cutting plane techniques as well as better models and algorithms for computational social choice applications such as kidney exchange markets and the fair division of indivisible goods.Cutting plane methods
Partial Hyperplane Activation for Generalized Intersection Cuts
With E. Balas, F. Margot, and S. Nadarajah.
Accepted at Mathematical Programming Computation (link to published version).
- Previously appeared as a poster, Computational investigation of generalized intersection cuts, at the Mixed Integer Programming Workshop in 2014, where it won the Best Poster Prize.
V-Polyhedral Disjunctive Cuts
Working paper.
- Winner of the INFORMS Computing Society Student Paper Award at the 2018 INFORMS Annual Meeting. The associated talk is V-polyhedral disjunctive cuts.
- Appeared as a poster, V-polyhedral cuts, at NemFest in 2017.
Cutting Planes by Tilting
Working paper.
- Appeared as a poster, Cutting planes by tilting, at the Mixed Integer Programming Workshop in 2016, where it won an Honorable Mention in the poster competition.
Sparse Cutting Planes for Nonconvex Quadratically-Constrained Quadratic Programs
With S. Dey, A. Lodi, and G. Muñoz.
Working paper available soon.
Computational social choice
On Tanking and Competitive Balance
With S. Vardi. Conference on Algorithmic Decision Theory, 2019.
How to Make Envy Vanish Over Time
With G. Benadè, A.D. Procaccia, and C.-A. Psomas. ACM Conference on Economics and Computation, 2018.
Small Representations of Big Kidney Exchange Graphs
With J.P. Dickerson, A.D. Procaccia, and T. Sandholm. AAAI Conference on Artificial Intelligence, 2017.
- Previously presented at EXPLORE workshop at AAMAS 2016, where it was awarded Most Visionary Paper.
Envy-Free Division of Sellable Goods
With J. Karp and A.D. Procaccia. AAAI Conference on Artificial Intelligence, 2014.
Guessing Preferences: A New Approach to Multi-Attribute Ranking and Selection
With P. Frazier. Winter Simulation Conference, 2011.