社会的マッチングのための1-1型ゲール・シャプレイ方式のコンピュータ・プログラム
スポンサーリンク
概要
- 論文の詳細を見る
The 1-1-type social matching problem in marriage can be described as follows. "There are the finite set M of men and the finite set of women. Every man has a total preference ordering over the set W and every women has a total preference ordering over the set M, according to the willingness to match respectively. When these preference orderings are given, how should men and women be matched under the condition that no man is matched to more than one woman and no woman is matched more than one man?" The social matching methods are the institutional arrangements by which the above matching is accomplished. It is known that the Gale-Shapley Method (GSM) for social matching has some desirable properties. However, there is no computer program of GSM with the following two functions. One is to be able to yield both Man-optimal-stable-outcome obtained by Man-Proposal-GSM (MPGSM) and Woman-optimal-stable-outcome obtained by Woman-Proposal-GSM (WPGSM). The other is to be able to output all of the matching processes made by use of MPGSM and WPGSM. Respectively. These functions are necessary for a computer program to support social matching effectively. The purpose of this paper is to develop a computer program of the 1-1-type GSM with the functions (it is called GASHAP). Its applicability to other type matching problems is also discussed. The result is that it is applicable to the 1-q- and p-q-type social matching problems with total or partial preference orderings by introducing the "dummy" and/or "clone" of man or woman.
- 群馬大学の論文