Gale–Shapley algorithm
en.wikipedia.org · 3,475 words · saved by 1 readers
Couldn't find lead section for Gale–Shapley_algorithm
Gale–Shapley algorithm - Wikipedia Jump to content From Wikipedia, the free encyclopedia Procedure for finding a stable matching In mathematics , economics , and computer science , the Gale–Shapley algorithm (also known as the deferred acceptance algorithm , [ 1 ] propose-and-reject algorithm , [ 2 ] or Boston Pool algorithm [ 1 ] ) is an algorithm for finding a solution to the stable matching problem . It is named for David Gale and Lloyd Shapley , who published it in 1962, although it had been used for the National Resident Matching Program since the early 1950s. Shapley and Alvin E. Roth (w
related reading
- The stable marriage problemacotra.substack.com
- The stable marriage problemsubstack.com
- Microsoft PowerPoint - lecture12.ppt [Compatibility Mode]cs.cmu.edu
- Tim Roughgarden's Lecture Notestimroughgarden.org
- Papers · Nikhil Garggargnikhil.com
- Algorithmic Game Theory (CS364A), Fall 2013timroughgarden.org
- The Matching Problem in Dating - Erik Torenbergeriktorenberg.substack.com
- main_cup.pdfcolumbia.edu
- Nash equilibrium - Wikipediaen.wikipedia.org
- Core (game theory) - Wikipediaen.wikipedia.org
- neuromatch: Algorithms to match scientists | Labs | eLifeelifesciences.org
- Game theory explains dinner-party dates.slate.com