Matching with preferences over colleagues solves classical matching (Q2268127)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5679465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matching with preferences over colleagues solves classical matching |
scientific article; zbMATH DE number 5679465 |
Statements
Matching with preferences over colleagues solves classical matching (English)
0 references
10 March 2010
0 references
The relatively brief note is devoted to the matching market models. Its main contribution consists in the suggestion of the first algorithm for finding of the complete set of stable matchings in any many-to-one matching. It follows from a reduction of the known matching problem to its modification with ``preferences over colleagues''. The main results regard the inspirational relation between the complexities of the matching problems with and without preferences over colleagues.
0 references
many-to-one matching
0 references
stability
0 references
matching algorithms
0 references
preferences over colleagues
0 references
0.8913521766662598
0 references
0.8267048001289368
0 references
0.8216032385826111
0 references
0.8163692355155945
0 references
0.8121216297149658
0 references
