Data structures and network algorithms
Data structures and network algorithms
Algorithms & data structures
The complexity of counting stable marriages
SIAM Journal on Computing
Three fast algorithms for four problems in stable marriage
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A new fixed point approach for stable networks stable marriages
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On likely solutions of a stable matching problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
LP based approach to optimal stable matchings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Hard variants of stable marriage
Theoretical Computer Science
The structure of stable marriage with indifference
Discrete Applied Mathematics
Inapproximability Results on Stable Marriage Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Approximability results for stable marriage problems with ties
Theoretical Computer Science
Polynomial time algorithm for an optimal stable assignment with multiple partners
Theoretical Computer Science
Sampling stable marriages: why spouse-swapping won't work
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to finding good stable matchings in the hospitals/residents setting
Theoretical Computer Science
Journal of Discrete Algorithms
The stable marriage problem with master preference lists
Discrete Applied Mathematics
The Generalized Stable Allocation Problem
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Manipulation and gender neutrality in stable marriage procedures
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Note: Optimal popular matchings
Discrete Applied Mathematics
Anarchy, Stability, and Utopia: Creating Better Matchings
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Stable marriages with multiple partners: efficient search for an optimal solution
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The generalized median stable matchings: finding them is not that easy
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Approximation algorithms for the sex-equal stable marriage problem
ACM Transactions on Algorithms (TALG)
Adaptive stable marriage algorithms
Proceedings of the 48th Annual Southeast Regional Conference
Manipulation complexity and gender neutrality in stable marriage procedures
Autonomous Agents and Multi-Agent Systems
Weights in stable marriage problems increase manipulation opportunities
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Event discovery in social media feeds
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Center stable matchings and centers of cover graphs of distributive lattices
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Linear programming brings marital bliss
Operations Research Letters
Approximation algorithms for the sex-equal stable marriage problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Cyclic stable matching for three-sided networking services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Two-sided matching with partial information
Proceedings of the fourteenth ACM conference on Electronic commerce
Modeling stable matching problems with answer set programming
RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
Note: Blockers and antiblockers of stable matchings
Theoretical Computer Science
| Hi-index | 0.04 |
In an instance of size n of the stable marriage problem, each of n men and n women ranks the members of the opposite sex in order of preference. A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other to their actual partners under the matching. It is well known [2] that at least one stable matching exists for every stable marriage instance. However, the classical Gale-Shapley algorithm produces a marriage that greatly favors the men at the expense of the women, or vice versa. The problem arises of finding a stable matching that is optimal under some more equitable or egalitarian criterion of optimality. This problem was posed by Knuth [6] and has remained unsolved for some time. Here, the objective of maximizing the average (or, equivalently, the total) “satisfaction” of all people is used. This objective is achieved when a person's satisfaction is measured by the position of his/her partner in his/her preference list. By exploiting the structure of the set of all stable matchings, and using graph-theoretic methods, an O(n4) algorithm for this problem is derived.