Discussion
In this section you can find some more detailed discussion around the problems implemented in matching as well as some context for the other packages out there.
| The stable marriage problem | The stable marriage problem (SM) describes the problem of finding a stable matching between two distinct, equally sized sets of players with complete preferences. |
| The hospital-resident assignment problem | The hospital-resident assignment problem (HR) is an extension of SM where residents must be assigned to placements at hospitals. |
| The student-allocation problem | The student-allocation problem (SA) is concerned with the allocation of students to projects and their supervisors. |
| The stable roommates problem | The stable roommates problem (SR) describes the problem of finding a stable matching of pairs from one even-sized set of players, all of whom have a complete preference of the remaining players. |
| CHANGES |
A summary of the changes between each version of matching
|
| Other packages | There exist a number of other open-source packages for completing game-theoretic tasks. |
No matching items