Stable Matching Problem

The Stable Matching Problem originated, in part, in 1962, when David Gale and Lloyd Shapley, two mathematical economists, asked the question: Could one design a college admissions process, or a job recruiting process, that was self-enforcing? What did they mean by this?

To set up the question, let’s first think informally about the kind of situation that might arise as a group of friends, all juniors in college majoring in computer science, begin applying to companies for summer internships. The crux of the application process is the interplay between two different types of parties: companies (the employers) and students (the applicants). Each applicant has a preference ordering on companies, and each company—once the applications come in--forms a preference ordering on its applicants. Based on these preferences, companies extend offers to some of their applicants, applicants choose which of their offers to accept, and people begin heading off to their summer internships.

Gale and Shapley considered the sorts of things that could start going wrong with this process, in the absence of any mechanism to enforce the status quo. Suppose, for example, that your friend Raj has just accepted a summer job at the large telecommunications company CluNet. A few days later, the small start-up company WebExodus, which had been dragging its feet on making a few final decisions, calls up Rai and offers him a summer iob as well. Now, Raj actually prefers WebExodus to CluNet--won over perhaps by the laid-back, anything-can-happen atmosphere--and so this new development may well cause him to retract his acceptance of the CluNet offer and go to WebExodus instead. Suddenly down one summer intern, CluNet offers a job to one of its wait-listed applicants, who promptly retracts his previous acceptance of an offer from the software giant Babelsoft, and the situation begins to spiral out of control.

Things look just as bad, if not worse, from the other direction. Suppose

that Raj’s friend Chelsea, destined to go to Babelsoft but having just heard Raj’s story, calls up the people at WebExodus and says, "You know, I’d really rather spend the summer with you guys than at Babelsoft." They find this very easy to believe; and furthermore, on looking at Chelsea’s application, they realize that they would have rather hired her than some other student who actually is scheduled to spend the summer at WebExodus. In this case, if WebExodus were a slightly less scrupulous company, it might well find some way to retract its offer to this other student and hire Chelsea instead.

Situations like this can rapidly generate a lot of chaos, and many people-- both applicants and employers--can end up unhappy with the process as well as the outcome. What has gone wrong? One basic problem is that the process is not self-enforcing--if people are allowed to act in their self-interest, then it risks breaking down.

We might well prefer the following, more stable situation, in which selfinterest itself prevents offers from being retracted and redirected. Consider another student, who has arranged to spend the summer at CluNet but calls up WebExodus and reveals that he, too, would rather work for them. But in this case, based on the offers already accepted, they are able to reply, "No, it turns out that we prefer each of the students we’ve accepted to you, so we’re afraid there’s nothing we can do." Or consider an employer, earnestly following up with its top applicants who went elsewhere, being told by each of them, "No, I’m happy where I am." In such a case, all the outcomes are stable—there are no further outside deals that can be made.

So this is the question Gale and Shapley asked: Given a set of preferences among employers and applicants, can we assign applicants to employers so that for every employer E, and every applicant A who is not scheduled to work for E, at least one of the following two things is the case?

(i) E prefers every one of its accepted applicants to A; or

(ii) A prefers her current situation over working for employer E.

If this holds, the outcome is stable: individual self-interest will prevent any applicant/employer deal from being made behind the scenes.

转载于:https://www.cnblogs.com/dreamafar/p/5986120.html

稳定婚姻问题:Gale–Shapley算法 (一)问题的引出 在组合数学、经济学、计算机科学中,稳定婚姻问题(英语:stable marriage problem,简称SMP)又称为稳定配对问题(stable matching problem),是指在两组同样大小的元素集合中(例如集合1是男子组、集合2是女子组,而他们各有偏好),寻求一个稳定配对组合所遇到的问题。一个组合在以下情况下并不稳定: 在集合1中有一个元素A更偏好于集合2的一些元素B,但元素A已被配对;而元素B亦更偏好于元素A多于配对给他的元素。在男女婚姻的角度来说,可以写成一名男子A获安排 阅读详情

相关推荐

Stable Matching Problem —— Gale Shapley算法

“一切算法都是从实际问题出发,深入理解问题内在的组合结构,从算法性着手进行设计。” Problem 学生申请不同的大学,大学接收不同的学生,能否找到一个自我完善的算法来解决这个问题,使得最终的结果是一个稳定的匹配结果?同样的可以用在求职者与公司的招聘工作中。 稳定匹配(Stable Matching)结果:不能找到一个申请方与一个接收方,使得他们各自都更喜欢彼此而胜过他们当前的匹配。 Fo

Oshyn —— 乐而学,学而乐 2944

稳定匹配问题Stable Match Problem -- 稳定婚姻问题 Stable Marriage Problem

稳定匹配问题Stable Match Problem 转自:http://hi.baidu.com/revinfly/item/e48b6fbab5145bf662388e95 问题的提出         《算法》的第一堂课讲了关于稳定匹配(Stable Matching)的问题,这是一个由现实情况引出的一个很有趣的问题。假设说现有一堆学生准备到一堆公司实习,每个学生心目中对这些公司都有一个

jiyanfeng1的专栏 1万+

算法导论(第三版)-复习- Stable Matching Problem

稳定婚姻算法 - Gale-Shapley算法

Calm down & Carry on 3241

Stable_matching problem

下面是男女喜欢的优先级顺序 Men={'V':['A','B','C','D','E'],'W':['B','C','D','A','E'],'X':['C','D','A','B','E'],'Y':['D','A','B','C','E'],'Z':['A','B','C','D','E']} Women={'A':['W','X','Y','Z','V'],'B':['X','Y','Z...

weixin_37961949的博客 772

GS problem: stable matching

背景提出:市场一方中的对象(医疗机构)向另一方中的对象(医学院学生)提出要约,每个学生会对自己接到的要约进行考虑,然后抓住自己青睐的(认为它是可接受的),拒绝其它的。该算法一个关键之处在于,合意的要约不会立即被接受,而只是被“抓住”(hold on to),也就是“延迟接受”。要约被拒绝后,医疗机构才可以向另一名医学院学生发出新的要约。整个程序一直持续到没有机构再希望发出新的要约为止,到那个时候,学

vuscity的博客 830

The Stable Matching/Marriage Problem

Java,stable matching

wxw1920的博客 382

Stable Matching Problem HDU1522

A simple problem about the match problem. We know that the KM algorithm solved the match problem with weight,but the stable matching is easier. first: the man ask the best on his mind and never bend

u013908212的专栏 512

A First Problem : Stable Matching(第一个重要问题:稳定匹配)

写在前面: 本文属于翻译内容,节选自 Jon Kleinberg及 Eva Tardos所著之算法宝书《Algorithm Design》的第一节“Stable Matching”,由于其影响力大,应该已被翻译成中文版本,但是本人在此承诺,以下的全部内容由我自行翻译(除了借用部分词典工具),绝无抄袭拷贝之行,还请大家监督。 之所以想翻译这一部分内容,是因为匹配算法是一个非常经典而有代表性的问题...

Meditator_hkx的博客 4251

经典算法问题——稳定匹配(Stable Matching

经典算法问题——稳定匹配(Stable Matching) 问题起源 在1962年,经济学家 David Gale 和 Lloyd Shapley 提出:能否设计一个高校录取过程,能够自我执行(self-enforcing)形成一个最佳的匹配效果。 算法的 C++ 实现代码请移步 Github:https://github.com/hotelll/CS222Note/tree/master/StableMatching 简易问题 问题描述 给出一个 nnn 个男性的集合 MMM 和 nnn 个女性的集

weixin_44230421的博客 9918

OSChina娱乐弹弹弹——离散数学之把妹要诀 ,你学会了吗?

2019独角兽企业重金招聘Python工程师标准>>> ...

weixin_34357928的博客 345

Stable Matching稳定匹配

一、稳定匹配婚姻问题 有n个男生n个女生,每个男生依照喜欢程度对n个女生进行了排序,同理每个女生也依照喜欢程度对n个男生进行了排序,现要将他们一一配对,要求所有的配对是稳定的,即不会出现一个女生相对自己配对的男生更喜欢另一个男生,而这个男生也更喜欢她的情况 二、伪代码实现 // 状态为free表示该男生未配对 // 首先初始化每个男生的状态为free Initialize each p...

by_study的博客 7519

稳定匹配问题(一)

稳定匹配问题(一) 经典稳定匹配问题--Gale-Shapley算法[1] 1. 算法描述 算法特点:延迟决定、产生的结果有偏向性 举例说明:  man  woman              woman   man             1:A  B  C                    A: 2  1  3             2:B  A  C

cxy的博客 5497

【算法】恋爱中的博弈论(stable matching)(附带源码)

思路源自知乎:知乎,主要是@尼克余 的回答。感谢他。然后原文有些描述不清楚的,我直接就按照我的理解补充上去了。 注:本文采用C#实现 首先假设一个虚拟世界,这个世界中分别有N个男生,N个女生,男生与女生数量完全一样,男生女生都有一个心仪对象列表,不同的人的心仪对象列表都是随机的,在心仪对象列表排名越前面,说明对于他(她)来说越喜欢。男生能向女生表白,女生不能向男生表白,女生能接

NxShow的博客 2901

科技中介如何高效匹配技术供需?.docx

科技中介如何高效匹配技术供需?

!qhyb.rar

当 CAD 缺失对应字体时,图纸文字会显示异常,出现乱码、问号。将下载好的字体文件复制到 AutoCAD 的 Fonts 文件夹中,即可恢复正常显示。

上一篇: Scrolling the Console Window
下一篇: Example: Writing Text Colors
acai83888
博客等级 码龄12年 0粉丝 0原创
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值