1 citations · 1 across the 5 of their papers we have counts for
6 papers
Distance flexibility in spatial matching: the value of concentration
Taha Ameen, Sophie H. Yu
In spatial matching markets, a supply unit's flexibility is measured by its service radius, the maximum distance at which it can serve demand. In dimensions , we study ho…
Optimal analysis of Greedy for stochastic online Euclidean matching: flat torus to the rescue
Mingwei Yang, Sophie H. Yu
We study online metric matching with servers and requests, all sampled independently and uniformly from . We analyze the Greedy algorithm, which matches each arriv…
A uniformity principle for spatial matching
Taha Ameen, Flore Sentenac, Sophie H. Yu
Platforms matching spatially distributed supply to demand face a fundamental design choice: given a fixed total budget of service range, how should it be allocated across supply no…
Optimal regret for dynamic matching with static priorities
Süleyman Kerimov, Pengyu Qian, Mingwei Yang +1
We study centralized two-way dynamic matching markets in which agents arrive stochastically over time and wait in queues associated with their types. We focus on static priority po…
From signaling to interviews in random matching markets
Maxwell Allman, Itai Ashlagi, Amin Saberi +1
In two-sided labor markets, interviews precede matches. Rising interview volumes in medical residency markets have motivated signaling mechanisms that let applicants express intere…
Online Metric Matching: Beyond the Worst Case
Mingwei Yang, Sophie H. Yu
We study the online metric matching problem. There are servers and requests located in a metric space, where all servers are available upfront and requests arrive one at a…