In this presentation Nick Psaris will present 4 famous iterative matching algorithms: the Stable Marriage (Gale-Shapley) algorithm, the Stable Roommate (Robert 1985) algorithm, the Hospital-Resident algorithm originally used by the National Resident Matching Program and the Student Allocation algorithm. Implementation and optimization considerations will be shared and comparisons with the canonical python ‘matching’ package will be made. To motivate the discussion and drive intuition, a live matching session between qbies and qgods will be enacted. Finally, Nick will suggest additions to the q language that would make the implementation more elegant. Come prepared to learn, laugh and lend a hand.
Here are some videos on YouTube about KXCON23 | Matching Algorithms in q and kdb:
- KXCON23 | Matching Algorithms in q and kdb by KX
- KXCON23 | Algorithms in q | kdb at NVIDIA Research by KX