Video Lectures

Over the last three decades, the online bipartite matching (OBM) problem has emerged as a central problem in the area of Online Algorithms. Perhaps even more important is its role in the area of Matching-Based Market Design.  The resurgence of this...

I will review two combinatorial constructions of integrable systems: Goncharov-Kenyon construction based on counting perfect matchings in bipartite graphs, and Gekhtman-Shapiro-Tabachnikov-Vainshtein construction based on counting paths in networks...