Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Stable_roommates_problem> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Stable_roommates_problem abstract "In mathematics, economics and computer science, particularly in the fields of combinatorics, game theory and algorithms, the stable roommate problem (SRP) is the problem of finding a stable matching — a matching in which there is no pair of elements, each from a different matched set, where each member of the pair prefers the other to their match. This is different from the stable marriage problem in that the stable roommates problem does not require that a set is broken up into male and female subsets. Any person can prefer anyone in the same set.It is commonly stated as: In a given instance of the Stable Roommates problem (SRP), each of 2n participants ranks the others in strict order of preference. A matching is a set of n disjoint (unordered) pairs of participants. A matching M in an instance of SRP is stable if there are no two participants x and y, each of whom prefers the other to his partner in M. Such a pair is said to block M, or to be a blocking pair with respect to M.".
- Stable_roommates_problem wikiPageExternalLink SRT.pdf.
- Stable_roommates_problem wikiPageID "15698614".
- Stable_roommates_problem wikiPageRevisionID "598361263".
- Stable_roommates_problem hasPhotoCollection Stable_roommates_problem.
- Stable_roommates_problem subject Category:Articles_with_example_pseudocode.
- Stable_roommates_problem subject Category:Combinatorics.
- Stable_roommates_problem subject Category:Cooperative_games.
- Stable_roommates_problem subject Category:Game_theory.
- Stable_roommates_problem subject Category:Matching.
- Stable_roommates_problem subject Category:Mathematical_problems.
- Stable_roommates_problem type Abstraction100002137.
- Stable_roommates_problem type Contest107456188.
- Stable_roommates_problem type CooperativeGames.
- Stable_roommates_problem type Event100029378.
- Stable_roommates_problem type Game100456199.
- Stable_roommates_problem type PsychologicalFeature100023100.
- Stable_roommates_problem type SocialEvent107288639.
- Stable_roommates_problem type YagoPermanentlyLocatedEntity.
- Stable_roommates_problem comment "In mathematics, economics and computer science, particularly in the fields of combinatorics, game theory and algorithms, the stable roommate problem (SRP) is the problem of finding a stable matching — a matching in which there is no pair of elements, each from a different matched set, where each member of the pair prefers the other to their match.".
- Stable_roommates_problem label "Problème des colocataires".
- Stable_roommates_problem label "Stable roommates problem".
- Stable_roommates_problem label "Задача о соседях по комнате".
- Stable_roommates_problem sameAs Problème_des_colocataires.
- Stable_roommates_problem sameAs m.03nqf35.
- Stable_roommates_problem sameAs Q3406260.
- Stable_roommates_problem sameAs Q3406260.
- Stable_roommates_problem sameAs Stable_roommates_problem.
- Stable_roommates_problem wasDerivedFrom Stable_roommates_problem?oldid=598361263.
- Stable_roommates_problem isPrimaryTopicOf Stable_roommates_problem.