Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Stable Roommates Problem
CHF 49.50
Auf Lager
SKU
RSD7H7K9UT4
1 Verfügbar 
Geliefert zwischen Do., 22.01.2026 und Fr., 23.01.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, especially in the fields of game theory and combinatorics, 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.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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131240591
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H6mm x B220mm x T150mm
- EAN 9786131240591
- Format Fachbuch
- Titel Stable Roommates Problem
- Gewicht 180g
- Herausgeber Betascript Publishing
- Anzahl Seiten 108
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
