Stable Matching (Algorithms 02)
Davidson CSC 321: Analysis of Algorithms, Fall 2022. Week 1 - Wednesday.
▶︎
Big-O Notation (Algorithms 03)
▶︎
Course Introduction (Algorithms 01)
![(AGT7E4) [Game Theory] Deferred Acceptance Algorithm (One-to-One Matching)](https://i.ytimg.com/vi/rh0RHYXu2RY/hqdefault.jpg?sqp=-oaymwE9CNACELwBSFryq4qpAy8IARUAAAAAGAElAADIQj0AgKJDeAHwAQH4AdQGgALgA4oCDAgAEAEYZSBSKE0wDw==&rs=AOn4CLCYXLJCNJ4SG7RHwqzrxwfQkYuZkw)
▶︎
(AGT7E4) [Game Theory] Deferred Acceptance Algorithm (One-to-One Matching)
▶︎
Stable Marriage Problem (the math bit)
▶︎
2.11.5 Optimal Stable Matching: Video
▶︎
2.11.1 Stable Matching: Video
▶︎
Greedy Exchange Arguments (Algorithms 09)
▶︎
Gale-Shapley Algorithm for Stable Matching Video Lesson
▶︎
Advanced Algorithms (COMPSCI 224), Lecture 1
▶︎
R8. NP-Complete Problems
▶︎
3SAT to Hamiltonian cycle reduction
▶︎
The mathematician who cracked Wall Street | Jim Simons
▶︎
Dynamic Programming (Algorithms 14)
▶︎
The Stable Matching Algorithm - Examples and Implementation
▶︎
Divide and Conquer (Algorithms 11)
▶︎
How Dijkstra's Algorithm Works
▶︎
Mother's Day Special: Variation of the Stable Marriage Problem
▶︎
Flow & Sorting Networks: Ford Fulkerson Method | Design and Analysis Of Algorithm (DAA)| Unit 4| IPU
▶︎
Residency Match (Stable Marriage Problem, Gale-Shapley Algorithm)
▶︎