Location:
Search - Gale-Shapley
Search list
Description: gale-sharpley 算法的详细设计步骤以及推广-gale-sharpley detailed design steps of the algorithm and to promote
Platform: |
Size: 279552 |
Author: oceanicbo |
Hits:
Description: 经典婚姻匹配算法，有源码和数据，能直接运行。-Classic marriage matching algorithm, source code and data that can be run directly.
Platform: |
Size: 3648512 |
Author: 陈贤 |
Hits:
Description: The Gale–Shapley algorithm involves a number of rounds (or iterations ). In the first round, first a) each unengaged man proposes to the woman he prefers most, and then b) each woman replies maybe to her suitor she most prefers and no to all other suitors. She is then provisionally engaged to the suitor she most prefers so far, and that suitor is likewise provisionally engaged to her. In each subsequent round, first a) each unengaged man proposes to the most-preferred woman to whom he has not yet proposed (regardless of whether the woman is already engaged), and then b) each woman replies maybe to her suitor she most prefers (whether her existing provisional partner or someone else) and rejects the rest (again, perhaps including her current provisional partner). The provisional nature of engagements preserves the right of an already-engaged woman to trade up (and, in the process, to jilt her until-then partner).-The Gale–Shapley algorithm involves a number of rounds (or iterations ). In the first round, first a) each unengaged man proposes to the woman he prefers most, and then b) each woman replies maybe to her suitor she most prefers and no to all other suitors. She is then provisionally engaged to the suitor she most prefers so far, and that suitor is likewise provisionally engaged to her. In each subsequent round, first a) each unengaged man proposes to the most-preferred woman to whom he has not yet proposed (regardless of whether the woman is already engaged), and then b) each woman replies maybe to her suitor she most prefers (whether her existing provisional partner or someone else) and rejects the rest (again, perhaps including her current provisional partner). The provisional nature of engagements preserves the right of an already-engaged woman to trade up (and, in the process, to jilt her until-then partner).
Platform: |
Size: 2048 |
Author: ahmetneseli |
Hits:
Description: gale-shapley算法的c++实现，用于稳定婚姻匹配，入学匹配，器官匹配等等问题-gale-shapley algorithm c++ implementation for stable marriage matching, enrollment matching, organ matching and so on
Platform: |
Size: 19456 |
Author: 李琪 |
Hits:
Description: 稳定匹配问题是算法理论中的典型问题之一,稳定婚姻匹配问题则是一种解决二部图匹配问题的模型。对稳定婚姻匹配问题进行了简单的阐述,并介绍了求解典型稳定婚姻问题的Gale-Shapley算法-Stable marriage matching problem is a model to solve the problem of the two graph matching. The problem of stable marriage matching is described briefly, and the Gale-Shapley algorithm is introduced.
Platform: |
Size: 27648 |
Author: 陈默 |
Hits:
Description: 稳定婚姻问题算法，给定n男n女，以及每个人对异性对象的喜好程度（按1至n排列）。安排男女结婚，使得不出现以下不稳定情形：
在n男n女中的存在两对夫妇(M, W)和(m, w)，M男对w女喜好度大于现任妻子W女，并且w女对M男喜好度也大于现任丈夫m男。(In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) 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 mapping from the elements of one set to the elements of the other set. A matching is not stable if:
There is an element A of the first matched set which prefers some given element B of the second matched set over the element to which A is already matched, and
B also prefers A over the element to which B is already matched.
In other words, a matching is stable when there does not exist any match (A, B) by which both A and B would be individually better off than they are with the element to which they are currently matched.)
Platform: |
Size: 1024 |
Author: peter1109 |
Hits:
Description: 实现稳定婚姻算法，解决在同等男士女士数量情况下的稳定配对问题(To achieve a stable marriage algorithm, to solve the problem of the stability of the same number of men in the case of the same)
Platform: |
Size: 1024 |
Author: Liu SJ |
Hits:
Description: 在Underlay Device-to-Device通讯环境下，考虑到基站对D2D接收团应如何分配资源
提高全体网络系统性能所必需的。
本文是在无线移动通信环境中均匀分布的蜂箱用户和D2D
针对有效的资源分配，运用了利用Gale-Shapley算法的配比理论。
…通过模拟实验获得的有限资源。
当Gale-Shapley运算法则对Gale-Shapley运算法则中的D2D页面进行测试时，
检验了整个系统性能的提高。(In the Underlay device-to-device communication environment, how should the base station allocate resources to the D2D receiving group
Required to improve overall network system performance.
In this paper, beehive users and D2D are uniformly distributed in wireless mobile communication environment
Aiming at the effective resource allocation, the matching theory using Gale-Shapley algorithm is applied.
...
Limited resources obtained through simulation experiments.
When the GALe-Shapley algorithm tested the D2D page in gale-Shapley algorithm,
The performance improvement of the whole system is examined.)
Platform: |
Size: 19456 |
Author: YY-YY-YY |
Hits: