WEKO3
アイテム
社会的マッチングのための1-1型ゲール・シャプレイ方式のコンピュータ・プログラム
http://hdl.handle.net/10087/2232
http://hdl.handle.net/10087/22324ddbc4ad-5fc9-423e-b012-1a720552f0db
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
KJ00000200470.pdf (1.5 MB)
|
|
| Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2007-12-25 | |||||
| タイトル | ||||||
| タイトル | 社会的マッチングのための1-1型ゲール・シャプレイ方式のコンピュータ・プログラム | |||||
| 言語 | ||||||
| 言語 | jpn | |||||
| その他のタイトル | ||||||
| その他のタイトル | A Computer Program of 1-1-Type Gale-Shapley Method for Social Matching | |||||
| 著者 |
富山, 慶典
× 富山, 慶典 |
|||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | 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. | |||||
| 書誌情報 |
群馬大学社会情報学部研究論集 巻 2, p. 1-26, 発行日 1996 |
|||||
| ISSN | ||||||
| 収録物識別子タイプ | ISSN | |||||
| 収録物識別子 | 1346-8812 | |||||
| 書誌レコードID | ||||||
| 収録物識別子タイプ | NCID | |||||
| 収録物識別子 | AN10477040 | |||||
| フォーマット | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | application/pdf | |||||
| 著者版フラグ | ||||||
| 出版タイプ | VoR | |||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
| 資源タイプ | departmental bulletin paper | |||||
| 出版者 | ||||||
| 出版者 | 群馬大学社会情報学部 | |||||
| 資源タイプ | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | Departmental Bulletin Paper | |||||
| 更新日 | ||||||
| 日付 | 2017-03-27 | |||||
| 日付タイプ | Created | |||||
