Talk:List of algorithms: Difference between revisions

Revision as of 23:29, 1 August 2023

Latest revision as of 09:56, 24 July 2025

(3 intermediate revisions by 3 users not shown)

Line 1:

{{WikiProject banner shell|class=List|1=

{{WikiProject Computing|class=List|importance=Lists}}

{{WikiProject Molecular BiologyComputing|class=List|COMPBIO=yes|COMPBIO-importance=mid}}

{{WikiProject StatisticsMolecular Biology|classCOMPBIO=Listyes|COMPBIO-importance=lowmid}}

{{WikiProject Statistics|importance=low}}

}}

{{Broken anchors|links=

Line 145 ⟶ 146:

Cheers.—[[User:InternetArchiveBot|'''<span style="color:darkgrey;font-family:monospace">InternetArchiveBot</span>''']] <span style="color:green;font-family:Rockwell">([[User talk:InternetArchiveBot|Report bug]])</span> 12:43, 26 July 2017 (UTC)

== Gale-Shapley algorithm ==

I provide here the evidences - for the sake of expediency - anyone:

findings were "marriage" is shown but sources indic. matching - part. the stable marriage problem is a type of matching problem. The fact: Teslet: p.32: Shapley & Roth won Nobel for Economics - applications of the algorithm indicated cannot be only: marriage.

*mathweb.ucsd.edu/~gptesler/154/slides/154_galeshapley_20-handout.pdf p.32 marriage shown as only one example of four

*www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/01StableMatching.pdf - doesn't even mention marriage

*web.stanford.edu/~ashishg/cs261/win21/notes/l5_note.pdf "We are going to study a classic problem, called the stable marriage problem. This is used in school choice, in resident matching, in network routers, and is one of the most beautiful matching problems." - doesn't exclude "matching" an shows mar. is sub of mat. (group in) mat.

[[User:Onemillionthtree|(𒌋*𓆏)𓆭]] 05:28, 26 April 2025 (UTC)