Tennenbaum Early Career Professor and
Assistant Professor
Education
- Ph.D. Computer Science (2023), University of Toronto
- M.S. Mathematics (2018), McGill University
- B.S. Mathematics (2016), Dalhousie University
About
Calum MacRury is a Tennenbaum Early Career Professor and Assistant Professor at the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech. Previously, he was a Postdoctoral Research Scholar at Columbia Business School where he was advised by Will Ma. Before that, he obtained his PhD from the Department of Computer Science at the University of Toronto where he was supervised by Allan Borodin.
Research
Calum MacRury is interested in optimization under uncertainty, particularly in the presence of randomness. This includes problems such as prophet inequalities, assortment optimization, and stochastic matching. A focus of his work is designing algorithms for these problems via randomized rounding tools.
Representative Publications
- Patrick Bennett and Calum MacRury, ``Extending Wormald’s Differential Equation Method to One-sided Bounds'', Combinatorics, Probability and Computing, 2025.
- Allan Borodin and Calum MacRury, ``Online Bipartite Matching in the Probe-Commit Model'', Mathematical Programming, 2025.
- Will Ma, Calum MacRury, and Pranav Nuti, ``Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities'', In the ACM Conference on Economics and Computation (EC), 2024.
- Calum MacRury and Will Ma, ``Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals'', In the Annual ACM Symposium on Theory of Computing (STOC), 2024.
- Calum MacRury, Will Ma, and Nathaniel Grammel, ``On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs'', Operations Research, 2024.