Stable matching problemStable matching problem
Uncommon
Rarity: Uncommon
A topic a little better known than average, read and translated beyond its own country.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In mathematics, economics, and computer science, the stable matching problem 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 bijection from the elements of one set to the elements of the other set.
Excerpt from the Wikipedia article “Stable matching problem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: No machine-readable author provided. User A1 assumed (based on copyright claims)., CC BY-SA 3.0, via Wikimedia Commons.
Open free boosters and add Stable matching problem to your collection.
Play for free

