Jack Dippel

Mathematician specializing in Algorithmic Game Theory, Combinatorial Optimization, Graph Theory, and Mechanism Design. PhD from McGill University (supervisor: Adrian Vetta). MMath from University of Waterloo (supervisor: Joseph Cheriyan). 7 publications at top venues: STACS, SIAM Journal on Discrete Mathematics, ACM EC, SAGT, Mathematical Programming. 118 citations. Erdős number 3.

Postdoctoral Researcher - Toronto Metropolitan University - Toronto, ON

(2023-01 - 2025-12)

Continued research program in graph theory and algorithmic game theory under postdoctoral appointment

• Produced publications and preprints extending results on network creation games and combinatorial structure
• Collaborated with researchers across institutions; presented at international conferences

PhD Researcher - McGill University - Montréal, QC

(2019-01 - 2024-12)

Dissertation research on Algorithmic Game Theory and Graph Theory under Prof. Adrian Vetta

• Proved that for all but one value of n, the Tree Conjecture holds in network creation games — published at STACS 2024
• Developed improved approximation algorithm for the Matching Augmentation Problem (ratio 9/5), published in SIAM Journal on Discrete Mathematics 2023
• Co-authored 'One Dollar Each Eliminates Envy' — a mechanism design result on envy-free fair division — published at ACM EC 2020
• Improved bound for the Tree Conjecture in Network Creation Games, published at SAGT 2022

MMath Researcher - University of Waterloo - Waterloo, ON

(2017-01 - 2019-12)

Master's thesis in Combinatorics & Optimization under Prof. Joseph Cheriyan

• Co-authored 'The Matching Augmentation Problem: a 7/4-approximation algorithm', published in Mathematical Programming 2020
• Research focused on approximation algorithms for graph connectivity problems

PhD - Mathematics - McGill University (2019-01 - 2024-12)

MMath - Combinatorics & Optimization - University of Waterloo (2017-01 - 2019-12)

BMath - Mathematics - University of Waterloo (2014-01 - 2017-12)