Singleton core in many-to-one matching problems (Q477777)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Singleton core in many-to-one matching problems |
scientific article; zbMATH DE number 6378775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Singleton core in many-to-one matching problems |
scientific article; zbMATH DE number 6378775 |
Statements
Singleton core in many-to-one matching problems (English)
0 references
9 December 2014
0 references
The conditions for the singleton core is a somewhat popular subject in cooperative game theory and economic development. The authors fix and analyze necessary and sufficient conditions for the uniqueness of stable matchings. The claimed results are motivated using two definitions and sustained by proving seven theoretical results compressed in theorems, corollaries and a lemma. Three examples are developed for illustrating the results.
0 references
acyclicity
0 references
stable matching
0 references
colleges preference relations
0 references
0.8449047803878784
0 references
0.8341332077980042
0 references
0.8129374384880066
0 references
0.8048633933067322
0 references
0.8033118844032288
0 references
