Fully Online Matching

Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=AOnAw6OaDCg



Duration: 52:03
10,963 views
18


We introduce a fully online model of maximum cardinality matching in which all vertices arrive online. On the arrival of a vertex, its incident edges to previously-arrived vertices are revealed. Each vertex has a deadline that is after all its neighbors' arrivals. If a vertex remains unmatched until its deadline, the algorithm must then irrevocably either match it to an unmatched neighbor, or leave it unmatched. The model generalizes the existing one-sided online model and is motivated by applications including ride-sharing platforms, real-estate agency, etc.

See more at https://www.microsoft.com/en-us/research/video/fully-online-matching/







Tags:
microsoft research