So my question refers to what precisely is a "Stable Matching"? I am aware of the Stable Marriage Problem, and all solutions seem to indicate that you finish with a "Stable Matching". But I am unsure as to what this actually means.
1
There are 1 best solutions below
Related Questions in STABLE-MARRIAGE
- Is it possible to use ES5 JavaScript with Angular 2 instead of TypeScript?
- Module '"angular2/angular2"' has no exported member 'For'
- import syntax in typescript creating another js file in visual studio
- Separate ts file for imports
- How to use an AngularJS 2 component multiple times in the same page?
- injectables not working in angular 2.0 latest build 26
- Does angular2 bootstrap have a way to dynamically target elements like it does in angular 1.x
- Import {} from location is not found in VS Code using TypeScript and Angular 2
- Angular 2/Typescript: require not found
- ng-switch in Angular2
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
I would stare at the .gif from the wiki because it is actually a great explanation of the mechanics.
In stable matching we guarantee that all elements from two sets (men & woman, kids & toys, persons & vacation destinations, whatever) are put in a pair with an element from the other set AND that pair is the "best available match"
The way we determine what is the "best available match" is imagine that each element of a set has ranked their preference for the elements of the opposite set. The goal is to satisfy the preferences of everybody. Sticking with the marriage problem, imagine every man has a ranked list of woman and every woman has a ranked list of men. The goal is to match them together making sure everybody gets the highest person on their list possible.
Keep in mind this takes several steps (or rounds) for this to work itself out. In the marriage example another thing to keep in mind is that each side can only do one thing. So in our example women accept, men propose. Also, the proposal is not binding. Meaning that if in round one, a woman gets a proposal from her #2 most desired man and in the next round she gets a proposal from her #1 man, she can reject #2 and take #1. The wiki said it better than I could so...
Basically, no one gets shafted in the marriage because the pair was the highest preference for one another given limited options.