✳flâneur — a map of the web's best reading
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
Explore this link on the map →related reading
- Tim Roughgarden's Lecture Notestimroughgarden.org
- Papers · Nikhil Garggargnikhil.com
- The Matching Problem in Dating - Erik Torenbergeriktorenberg.substack.com
- Algorithmic Game Theory (CS364A), Fall 2013timroughgarden.org
- 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
- Focal point (game theory) - Wikipediaen.wikipedia.org
- OsborneRubinsteinMasterpiece.pdfsites.math.rutgers.edu
- Folk theorem (game theory) - Wikipediaen.wikipedia.org