当前位置:编程学习 > JAVA >>

Gale-Shapley algorithm 博弈算法

真是个比较好的算法,非常易用,老早就出来了,最近才得的诺奖

伪代码如下

 

[java]
Algorithm 伪代码 
//GS算法婚姻配对 
function stableMatching { 
    //初始化所有m和w 
    Initialize all m ∈ M and w ∈ W to free 
    //如果存在自由男人没向所有的女人求过婚 
    while ? free man m who still has a woman w to propose to { 
       //w赋值为此男人当前得分最高的女人 
       w = m's highest ranked such woman to whom he has not yet proposed 
       if w is free 
         (m, w) become engaged 
       else some pair (m', w) already exists 
         if w prefers m to m' 
           (m, w) become engaged 
           //下面一行隐含的操作是此男人的求婚列表向下一个移动 
           m' becomes free 
         else 
           (m', w) remain engaged 
    } 


 

补充:软件开发 , Java ,
CopyRight © 2012 站长网 编程知识问答 www.zzzyk.com All Rights Reserved
部份技术文章来自网络,