MS&E 319: Matching Theory, Fall 2019

Location: Lane History Corner 200-107, Tuesdays and Thursdays 10:30-11:50.

Instructor: Amin Saberi
Office Hours: by appointment
Teaching Assistant: Mobin Yahyazadeh (yahyazad@stanford)
Office Hours: Tuesdays 5-6 pm, Huang 138 this week (10/15), Huang 219 every other week

Course description:
The theory of matching with its roots in the work of mathematical giants like Euler and Kirchhoff has played a central and catalytic role in combinatorial optimization for decades. More recently, the growth of online marketplaces for allocating advertisements, rides, or other goods and services has led to new interest and progress in this area. The course starts with classic results characterizing matchings in bipartite and general graphs and explores connections with algebraic graph theory and discrete probability. Those results are complemented with models and algorithms developed for modern applications in market design, online advertising, and ride sharing.

Reading material:
Lecture notes or link to papers & surveys will be available on the class webpage. The following textbook is recommended:
Course load and grading:
Two homework assignments (15% each), scribing notes for one lecture (20%), and research project and presentation (50%).

Lectures:
Sample file for scribes

Homework:
You can find last year course homepage in here.