Lecture on Online Matching

7^th November 2018, 13:00
Argyrios Deligkas
University of Liverpool

Abstract

In this seminar, I will present the model and some proofs for a generalised model of online matching.
Furthermore, I will present some open problems and a further generalisation of the model and an extension to a stochastic optimisation model.

Paper: How to match when all vertices arrive online (Zhiyi Huang, Ning Kang, Zhihao Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu, STOC'18 )

Additional Materials

• https://www.microsoft.com/en-us/research/video/fully-online-matching/#!related_info