Update: I have moved -- I am a postdoc with Michal Feldman; I can still be reached at the email address listed above. I obtained my Ph.D. in Computer Science (Combinatorics and Game Theory) under the excellent supervision of Adrian Vetta at McGill University, where we worked on analyzing the equilibria of auctions and on fair division. I have an M.Math. degree (Combinatorics and Optimization) from the University of Waterloo, where I was advised by Joseph Cheriyan and analyzed approximation algorithms for problems in graph connectivity.
Preprints and Working Papers
-
Who Wins Hex When One Player Plays Randomly?
With J. Barrett, N. Brustle, S. Clusiau, R. Hayward, N. Ndiaye, and B. Reed
Publications
Journal
| J5. |
The Speed and Threshold of the Biased Perfect Matching and Hamilton Cycle Games With N. Brustle, S. Clusiau, N. Ndiaye, B. Reed and B. Seamone Discrete Applied Mathematics: LAGOS 2021 Special Issue (2023) Supersedes C5 and C6 |
| J4. |
Online Coloring and a New Type of Adversary for Online Graph Problems With Y. Li and D. Pankratov Algorithmica (2022) Supersedes C4 |
| J3. |
The Declining Price Anomaly is not Universal in Multi-Buyer Sequential Auctions (but almost is) With E. Prebet and A. Vetta Theory of Computing Systems: SAGT 2019 Special Issue (2022) Supersedes C2 |
| J2. |
Risk-Free Bidding in Complement-Free Combinatorial Auctions With G. Rayaprolu and A. Vetta Theory of Computing Systems: SAGT 2019 Special Issue (2022) Supersedes C1 |
| J1. |
The Matching Augmentation Problem: A 7/4-Approximation Algorithm With J. Cheriyan, J. Dippel, F. Grandoni and A. Khan Mathematical Programming (2020) |
Conference
| C8. |
Fair Chore Division Under Binary Supermodular Costs With S. Barman and P. Verma AAMAS 2023 -- extended abstract |
| C7. |
Two Birds With One Stone: Fairness and Welfare via Transfers With M. Suzuki and A. Vetta SAGT 2021 |
| C6. |
The Speed and Threshold of the Biased Hamilton Cycle Game With N. Brustle, S. Clusiau, N. Ndiaye, B. Reed and B. Seamone LAGOS 2021 |
| C5. |
The Speed and Threshold of the Biased Perfect Matching Game With N. Brustle, S. Clusiau, N. Ndiaye, B. Reed and B. Seamone LAGOS 2021 |
| C4. |
Online Coloring and a New Type of Adversary for Online Graph Problems With Y. Li and D. Pankratov WAOA 2020 [WAOA'20 talk] |
| C3. |
One Dollar Each Eliminates Envy With J. Brustle, J. Dippel, M. Suzuki and A. Vetta EC 2020 [EC'20 talk] |
| C2. |
The Declining Price Anomaly is not Universal in Multi-Buyer Sequential Auctions (but almost is) With E. Prebet and A. Vetta SAGT 2019 [Best Paper] |
| C1. |
Risk-Free Bidding in Complement-Free Combinatorial Auctions With G. Rayaprolu and A. Vetta SAGT 2019 |
Theses
- Approximating Minimum-Size 2-Edge-Connected and 2-Vertex-Connected Spanning Subgraphs (M.Math. 2017)