1 citations · 1 across the 4 of their papers we have counts for
4 papers
From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
Aaron Bernstein, Jiale Chen
We study the approximate maximum weight matching (MWM) problem in a fully dynamic graph subject to edge insertions and deletions. We design meta-algorithms that reduce the problem…
Stable Matching with Interviews
Itai Ashlagi, Jiale Chen, Mohammad Roghani +1
In several two-sided markets, including labor and dating, agents typically have limited information about their preferences prior to mutual interactions. This issue can result in m…
Matching Composition and Efficient Weight Reduction in Dynamic Matching
Aaron Bernstein, Jiale Chen, Aditi Dudeja +3
We consider the foundational problem of maintaining a -approximate maximum weight matching (MWM) in an -node dynamic graph undergoing edge insertions and deleti…
Entropy Regularization and Faster Decremental Matching in General Graphs
Jiale Chen, Aaron Sidford, Ta-Wei Tu
We provide an algorithm that maintains, against an adaptive adversary, a -approximate maximum matching in -node -edge general (not necessarily bipartite) und…