I was reading Stable Marriage Problem(SMP, https://en.wikipedia.org/wiki/Stable_marriage_problem) with indifference and I came across the terms strongly stable, weakly stable and super stable matching. What is the difference between them?
What is the difference between strongly stable, weakly stable and super stable matching?
568 Views Asked by Ishpreet At
1
There are 1 best solutions below
Related Questions in MATCHMAKING
- Problem with Matchmaking two players in realtime database
- Bin Packing Algorithm for Teammate finder app?
- Generating the docker image when open-match proto api is updated
- problem in real time match-making and lobby implementation
- Javascript (nodejs) matchmaking queue
- Dummy players in with unity matchmaker
- How to create an algorithm for matchmaking using jetpack compose and MongoDb?
- Gale Shapley matching algorithm with Polygamy by Men Upto four Marriages Using Bipartite Graph
- How to use django channel to create a game lobby and matchmaking
- Best way to implement matchmaking queue for a competitive game
- Match users in pair array but avoid previous matches
- Is there an efficient algorithm for maching unique individuals so that no group of them have ever seen each other?
- Algorithm to match most possible combinations
- Trying to select a random user against the current user for a match with both having the same role
- Firebase Realtime Database - Matchmaking using transactions = High download usage
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?
In my opinions, they are three stable matching status with different degrees of requirements for matching on preference lists with ties.
Super stable is the most strict among them, and then the strongly stable, weakly stable has the least restriction at last.
Suppose there is a rogue couple (m,w) who don't match with each other in a matching, they will break the properties of the matching when: