stable marriage problem

back to index

description: a mathematical problem of matching members of two groups so that no pair would prefer another partner

3 results

The Formula: How Algorithms Solve All Our Problems-And Create More

by Luke Dormehl  · 4 Nov 2014  · 268pp  · 75,850 words

named David Gale and Lloyd Shapley set out to devise an algorithmic solution to just this conundrum. What they came up with was called The Stable Marriage Problem—also known as “The Match.”1 To explain The Match, picture a remote island, cut off from the rest of civilization. On this island, there

everyone wants to marry everyone, does not necessarily yield the same stable outcome as the relatively straightforward matching I described. Another issue is that the Stable Marriage Problem presumes that all people of marriageable age do, in fact, wish to get married, and that the location in which they live is so remote

Gale and Lloyd Shapley, this seems the most grievous. I do, of course, write these words with tongue firmly planted in cheek. As noted, the Stable Marriage Problem invokes romantic marriage as metaphor only, being designed for the purpose of matching medical students with hospitals. For this task it is largely suitable—since

Soddu, Celestino 204 Solid Gold Bomb 224 Sony Walkman 14 Spacey, Kevin 188–89 spam 58 Speed 44 Spielberg, Arnold 164 Spielberg, Steven 118, 164 Stable Marriage Problem, see “Match” Stairmaster 14 Stanton, Andrew 163 Star Wars 161 Stendhal 70 Steve Jobs (Isaacson) 36 Stone, Brad 214 Strangers on a Train 17 Striphas

The Mathematics of Love: Patterns, Proofs, and the Search for the Ultimate Equation

by Hannah Fry  · 3 Feb 2015  · 88pp  · 25,047 words

three, and especially when compared to the boys, who ended up with their first, second, and first choices respectively. This setup is known as the ‘stable marriage problem’, and the process through which the friends picked their partners is called the Gale-Shapley algorithm. If we look into the mathematics behind these couplings

take the initiative. The difference in outcomes between those who do the asking and those who wait to be asked is particularly important when the stable marriage problem is applied beyond imaginary couples at a party: something the US government found out the hard way. Through the National Resident Matching Program, the US

so. 4 Online Dating So hopefully you’re now bold enough to approach the hotties at a party, armed only with your knowledge of the stable marriage problem. But too many parties in a row can be a bit exhausting, and not many of them will have a Joey or a Rachel to

Lloyd Shapley. ‘College Admissions and the Stability of Marriage.’ The American Mathematical Monthly 69, No. 1, 1962. McVitie, D. G. and L. B. Wilson. ‘The Stable Marriage Problem.’ Communications of the ACM, 14(7), 1971. CHAPTER 4: ONLINE DATING Rudder, Christian. ‘Inside OKCupid: The Math of Online Dating’ (2013): http://www­.you­tube

The Creativity Code: How AI Is Learning to Write, Paint and Think

by Marcus Du Sautoy  · 7 Mar 2019  · 337pp  · 103,522 words

creators a Nobel Prize, originally formulated by two mathematicians, David Gale and Lloyd Shapley, in 1962, used a matching algorithm to solve something called ‘the Stable Marriage Problem’. Gale, who died in 2008, missed out on the award, but Shapley shared the prize in 2012 with the economist Alvin Roth, who saw the

. ‘I never, never in my life took a course in economics.’ But the mathematics he cooked up has had profound economic and social implications. The Stable Marriage Problem that Shapley solved with Gale sounds more like a parlour game than a piece of cutting-edge economic theory. To illustrate the precise nature of

filters 90–1 SPEAC 198–200, 198 Spielberg, Steven 115 Spotify 135, 224–5 square root 1; of minus one 12; of 2 163, 244 Stable Marriage Problem, The 57–61, 58, 59, 60 Stanford University 48, 196, 259; Law School 109 Star Trek: The Next Generation (Cause and Effect episode) 251 Steels