11.1.1. Matching Problem

Try these first

1. 1.

   What is the matching problem?

   Hint

   Think about matching pairs.

2. 2.

   Define a bipartite graph.

   Hint

   Remember the two groups in the graph.

3. 3.

   What is a bipartite graph?

   • A graph with no edges
   • Edges between two distinct sets
   • A circular graph

   Hint

   Think about the sets involved in the graph.

4. 4.

   In a matching problem, can a teacher teach more than one course?

   • True
   • False

   Hint

   Consider the rules of allocation.

5. 5.

   Suppose there are 6 teachers and 3 courses. Each teacher has their preferences for the courses. Describe the steps to find an optimal matching.

   Hint

   Think about how you would visualize the preferences.

6. 6.

   If a new course is added to an existing matching scenario, how would you approach adjusting the current allocations?

   Hint

   Consider how additional options can lead to new combinations.