blockversewordysbillionaire.aiyourlistWhiteboardAppquizieunschool

News

Home
Popular
Elections

Genius — OpenServe

Sponsored

Gale–Shapley algorithm — latest news, discussion & facts — IJR

Gale–Shapley algorithm

Topic

Gale–Shapley algorithm

algorithm for solving the stable matching problem

0members1here now

Ask Genius Site

Feed Discussions About

Sort by

Content type

Loading

Latest Gale–Shapley algorithm news and discussion

Sort by

Content type

Nothing published yet

The conversation starts anyway — post the first discussion above.

About Gale–Shapley algorithm

In mathematics, economics, and computer science, the Gale–Shapley algorithm 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 in The American Mathematical Monthly, although it had been used for the National Resident Matching Program since 1952 despite lacking the theoretical foundation. Shapley and Alvin E. Roth won the 2012 Nobel Prize in Economics for work including this algorithm. It had been said that Gale would have been the third co-recipient of the Prize, if he were alive.

0

members

1

here now

Everything about Gale–Shapley algorithm →

Facts from Wikidata (CC0).

Live room · 1 here

Be the first in the room — members see you arrive.

Gale–Shapley algorithm across IJR

Ask Genius by OpenServe about Gale–Shapley algorithm Create in Studio Build a game Watch videos