Olivetti Club
Tuesday, December 8, 2020 - 4:30pm
Online
Consider the problem of assigning workers to various jobs. Workers may be qualified for some subset of the jobs, and it may not be possible to fill all of the jobs. If we order the jobs by priority, we want to determine how we can best assign workers to jobs so jobs with highest priority are filled. Matroid theory gives a particularly nice solution to this problem. In this talk we will give a brief introduction to matroids. We will then show how we can use matroid theory to solve the optimal assignment problem described above.
Refreshments will be served in the lounge at 4:00 PM.