1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.PR2024
Optimal Unimodular Matching
Nathanaël Enriquez, Mike Liu, Laurent Ménard +1
We consider sequences of finite weighted random graphs that converge locally to unimodular i.i.d. weighted random trees. When the weights are atomless, we prove that the matchings…
cs.DS2023★ 1 cited
Online Matching in Geometric Random Graphs
Flore Sentenac, Nathan Noiry, Matthieu Lerasle +2
We investigate online maximum cardinality matching, a central problem in ad allocation. In this problem, users are revealed sequentially, and each new user can be paired with any p…