Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q620702> ?p ?o }
Showing triples 1 to 48 of
48
with 100 triples per page.
- Q620702 subject Q7012142.
- Q620702 subject Q7020692.
- Q620702 subject Q7036109.
- Q620702 subject Q7132787.
- Q620702 subject Q8417636.
- Q620702 abstract "In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a mapping from the elements of one set to the elements of the other set. A matching is stable whenever it is not the case that both the following conditions hold.In other words, a matching is stable when there does not exist any match (A, B) by which both A and B are individually better off than they would be with the element to which they are currently matched.The stable marriage problem has been stated as follows:Given n men and n women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. When there are no such pairs of people, the set of marriages is deemed stable.Note that the requirement that the marriages be heterosexual distinguishes this problem from the stable roommates problem.".
- Q620702 thumbnail Gale-Shapley.gif?width=300.
- Q620702 wikiPageExternalLink Nisan_Non-printable.pdf.
- Q620702 wikiPageExternalLink NRMP.
- Q620702 wikiPageExternalLink smp.html.
- Q620702 wikiPageExternalLink kleinberg.
- Q620702 wikiPageExternalLink lecture5.pdf.
- Q620702 wikiPageExternalLink EGS.html.
- Q620702 wikiPageExternalLink www.masfoundations.org.
- Q620702 wikiPageExternalLink download.html.
- Q620702 wikiPageExternalLink gale-shapley.
- Q620702 wikiPageWikiLink Q1065144.
- Q620702 wikiPageWikiLink Q1174507.
- Q620702 wikiPageWikiLink Q17143488.
- Q620702 wikiPageWikiLink Q17457.
- Q620702 wikiPageWikiLink Q174733.
- Q620702 wikiPageWikiLink Q206904.
- Q620702 wikiPageWikiLink Q21198.
- Q620702 wikiPageWikiLink Q215206.
- Q620702 wikiPageWikiLink Q23389.
- Q620702 wikiPageWikiLink Q244739.
- Q620702 wikiPageWikiLink Q281922.
- Q620702 wikiPageWikiLink Q28542.
- Q620702 wikiPageWikiLink Q3406260.
- Q620702 wikiPageWikiLink Q395.
- Q620702 wikiPageWikiLink Q47170.
- Q620702 wikiPageWikiLink Q620614.
- Q620702 wikiPageWikiLink Q651022.
- Q620702 wikiPageWikiLink Q6978073.
- Q620702 wikiPageWikiLink Q7012142.
- Q620702 wikiPageWikiLink Q7020692.
- Q620702 wikiPageWikiLink Q7036109.
- Q620702 wikiPageWikiLink Q7132787.
- Q620702 wikiPageWikiLink Q72588.
- Q620702 wikiPageWikiLink Q783630.
- Q620702 wikiPageWikiLink Q8134.
- Q620702 wikiPageWikiLink Q8366.
- Q620702 wikiPageWikiLink Q8417636.
- Q620702 wikiPageWikiLink Q8445.
- Q620702 wikiPageWikiLink Q912887.
- Q620702 comment "In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a mapping from the elements of one set to the elements of the other set.".
- Q620702 label "Stable marriage problem".
- Q620702 depiction Gale-Shapley.gif.