IEOR 8100 Matchings
Fall 2018

Matchings

Professor Cliff Stein

Overview

Matchings play a central role in algorithms, optimization and combinatorics. . There are many variants of matching problems and they arise in a large number of applications. We will study a series of algorithms for matching and its extensions. Because of the central role that matching problem have played, there are a wide range of algorithms and by studying matchings, we will learn many interesting techniques that are widely applicable to other graph and combinatorial problems. Specific topics studied will include: We will also study several applications. The most prevalent will be matching problems that arise in internet advertising, as these applications have inspired some of the most interest algorithmic work on matching in the last several years.

Information


Homework

Lecture Schedule

  1. 9/17 - Introduction. Matching algorithms. Duality.
  2. 9/24 - Effiicent matching algorithms.
  3. 9/28 - Finish Hungarian algorithm. Gabow Tarjan.
  4. 10/8 - finish gabow-tarjan, non-bipartite matchings
  5. 10/15 - parallel matchings, introduction to map reduce model, EDCS and parallel model
  6. 10/22 - Streaming
    1. Xingyu Zhang. Graph problems in a semi streaming model.
    2. Austin Palmer. Matchings in a semi-streaming model
  7. 10/29 - Dynamic Matchings
    1. Oussama Hanguir. Primal Dual
    2. Philippe Mizrahi. Log Update Time
  8. 11/12 Adwords (1)
    1. Jingtong Zhao. Adwords problem. Metha et. al.
    2. Omar El Housni. Online primal-dual for adwords. Buchbinder Jain.
  9. 11/19 Adwords (2)
    1. Michael Hamilton. Stochastic adwords problem. Feldman et. al.
    2. Sai Mali. Getting both a stochastic and a determistic guarantee. Mirokni et. al.
  10. 11/26 Stable/Popular/Fair Matchings (1)
    1. Lingyi Zhang. Popularity vs. Fairness
    2. Jia Wan. A Fixed Point Approach to Stable Matchings and Some Applications
  11. 12/3 Stable/Popular/Fair Matchings (2)
    1. Xujia Lui . Popular Matchings
    2. Xuan Zhang. Fair Matchings
  12. 12/10. (Plus some other data TBA)
    1. Victor Lacomte. Madry flow paper
    2. Xiao Lei. paper by Alvin Roth
    3. Yeqing Zhou. Bouding the Number of flips

Course Announcements