Anonymous user
Talk:Stable marriage problem: Difference between revisions
The name (from wp and other sources), seems to be Shapley (which was probably auto-mis-corrected to Shapely)
(→Nobel Prize: new section) |
(The name (from wp and other sources), seems to be Shapley (which was probably auto-mis-corrected to Shapely)) |
||
(3 intermediate revisions by 3 users not shown) | |||
Line 61:
== Title ==
Since this specifies the Gale-
: Ah, your thinking logically. That's your problem! :-)
: Stable marriage problem is more often quoted than the algorithm used to solve it, although it looks like that algorithm is the only one used to solve the problem (apart from exhaustive search). See [http://googlefight.com/index.php?lang=en_GB&word1=%22Gale+
:: Created [[Gale-
::: An excellent solution I think! --[[User:Paddy3118|Paddy3118]] 15:06, 26 August 2010 (UTC)
Line 172:
The 2012 Nobel Prize in Economics was awarded to Roth and Shapley for work that began with this algorithm. It seems the algorithm was the start of a new field called "market design" that goes far beyond marriage design, and that even the original Gale/Shapley algorithm has more general applications. —[[User:Sonia|Sonia]] 21:22, 16 October 2012 (UTC)
: Thanks for this nugget. --[[User:Paddy3118|Paddy3118]] 15:54, 17 October 2012 (UTC)
== OOP? ==
After looking at some of the solutions here, I noticed that there are several that used a language with OOP capabilities, but did not come up with an object-oriented solution. I'm not saying that's good or bad necessarily; but it would be interesting to see more solutions that go beyond translations of straight procedural logic. --[[User:MikeLorenz|Mike Lorenz]] 05:06, 3 November 2012 (UTC)
== PHP ==
If you want you can add my PHP port of the Python version from: http://www.leaseweblabs.com/2013/04/stable-marriage-problem-in-php/
--[[User:Maurits|Maurits]] ([[User talk:Maurits|talk]]) 15:01, 24 April 2013 (UTC)
|