Results 251 to 260 of about 2,017,974 (284)
Stable marriage and indifference
Discrete Applied Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert W Irving
exaly +2 more sources
The structure of stable marriage with indifference [PDF]
Discrete Applied Mathematics, 2002 The author considers the stable marriage problem where participants are permitted to express indifference in their preference list. One proves that, in an instance where indifference takes the form of ties, the set of strongly stable matchings forms a distributive lattice. If indifference is in the form of arbitrary partial order, it turns out that the
David Manlove
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Polyhedral Aspects of Stable Marriage
Mathematics of Operations Research, 2014In the setting of the stable matching (SM) problem, it has been observed that some of the man-woman pairs cannot be removed although they participate in no stable matching, since such a removal would alter the set of solutions. These pairs are yet to be identified. Likewise (and despite the sizeable literature), some of the fundamental characteristics
Pavlos Eirinakis +2 more
exaly +2 more sources
Hard variants of stable marriage [PDF]
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Manlove +2 more
exaly +4 more sources
Refined Inequalities for Stable Marriage
Constraints, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brian Aldershof +2 more
openaire +3 more sources
The Complexity of Counting Stable Marriages
SIAM Journal on Computing, 1986In 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 to 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 that the least one
Robert W. Irving, Paul Leather
openaire +3 more sources
Stable Marriage in Euclidean Space
International Joint Conference on Autonomous Agents and Multiagent Systems, 2023We study stable marriage problems in the d-Euclidean space. Under this setting, each agent is represented as a point in the d-dimensional space, and for each agent a, the preference of a is based on the sorting according to the Euclidean distances between a and agents from the opposite gender.
Yinghui Wen, Zhongyi Zhang, Jiong Guo
openaire +2 more sources
Stable marriages by coroutines
Information Processing Letters, 1983Abstract The stable marriage problem is an appealing version of many pairing problems. A solution by coroutines is given, based on the recursive algorithm of McVitie and Wilson (1971). There are few published algorithms where coroutines are really useful but they solve this problem very naturally.
openaire +2 more sources
Formally certified stable marriages
Proceedings of the 48th Annual Southeast Regional Conference, 2010We present an implementation of the Gale-Shapley stable matching algorithm in the Coq proof assistant. The resulting program is guaranteed to terminate and provides a proof of the stability of the matchings that it produces. While proofs of the algorithm's termination and correctness exist on paper, our purpose was to investigate the process of ...
Nadeem Abdul Hamid, Caleb Castleberry
openaire +1 more source
Communication Requirements for Stable Marriages
2010We study the stable marriage problem in a distributed environment, in which there are 2n players, n men and n women, each holding a private ranking of the n persons of the opposite set, and there is a server who communicates with the players and finds a matching for them.
Jen-Hou Chou, Chi-Jen Lu
openaire +2 more sources