Settling the Sharp Reconstruction Thresholds of Random Graph Matching. - Yihong Wu 001; Jiaming Xu 002; Sophie H. Yu (IEEE Trans. Inf. Theory, 2022)

Constant Regret Primal-Dual Policy for Multi-way Dynamic Matching. - Yehua Wei; Jiaming Xu 002; Sophie H. Yu (SIGMETRICS (Abstracts), 2023)

Random Graph Matching at Otter's Threshold via Counting Chandeliers. - Cheng Mao; Yihong Wu 001; Jiaming Xu 002; Sophie H. Yu (STOC, 2023)

Matching in networks: fundamental limits and efficient algorithms. - Sophie H. Yu (2023)

Stochastic Online Metric Matching: Adversarial is no Harder than Stochastic. - Amin Saberi; Mingwei Yang 002; Sophie H. Yu (CoRR, 2024)

From Signaling to Interviews in Random Matching Markets. - Maxwell Allman; Itai Ashlagi; Amin Saberi; Sophie H. Yu (STOC, 2025)

Achieving constant regret for dynamic matching via state-independent policies. - Süleyman Kerimov; Mingwei Yang 002; Sophie H. Yu (CoRR, 2025)