Talk:Stable marriage problem: Difference between revisions
Content added Content deleted
No edit summary |
(The name (from wp and other sources), seems to be Shapley (which was probably auto-mis-corrected to Shapely)) |
||
| Line 61: | Line 61: | ||
== Title == |
== Title == |
||
Since this specifies the Gale- |
Since this specifies the Gale-Shapley algorithm, shouldn't that be the name of the task? Similar to how [[Lucas-Lehmer test]] finds Mersienne primes? --[[User:Short Circuit|Michael Mol]] 16:30, 23 August 2010 (UTC) |
||
: Ah, your thinking logically. That's your problem! :-) |
: 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+ |
: 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+Shapley+algorithm%22&word2=%22Stable+marriage+problem%22 this]. --[[User:Paddy3118|Paddy3118]] 21:58, 23 August 2010 (UTC) |
||
:: Created [[Gale- |
:: Created [[Gale-Shapley algorithm]] as a redirect to this task. –[[User:Dkf|Donal Fellows]] 14:34, 26 August 2010 (UTC) |
||
::: An excellent solution I think! --[[User:Paddy3118|Paddy3118]] 15:06, 26 August 2010 (UTC) |
::: An excellent solution I think! --[[User:Paddy3118|Paddy3118]] 15:06, 26 August 2010 (UTC) |
||