Downloads: 995

Files in This Item:
File Description SizeFormat 
IEICE_tec.rep_AI2009-12.pdf1.52 MBAdobe PDFView/Open
Title: 安定マッチング問題に関する最近の話題
Other Titles: Recent Topics on the Stable Matching Problems
Authors: 宮崎, 修一  KAKEN_id  orcid (unconfirmed)
Author's alias: Miyazaki, Shuichi
Keywords: 安定マッチング問題
stable marriage problem
approximation algorithms
Issue Date: 18-Sep-2009
Publisher: 電子情報通信学会
Journal title: 電子情報通信学会技術研究報告
Volume: 109
Issue: 211
Start page: 19
End page: 22
Thesis number: AI2009-12
Abstract: 安定マッチング問題とは, 男女の集合と, 各人の異性に対する希望リストが与えられたとき, 「安定性」と呼ばれる性質を満たす男女間のマッチングを求める問題である.本問題は, 研修医の病院配属や生徒の学校への配属, 大学における学生の研究室配属等, 応用の広い問題である.本講演では, 本問題の紹介を行うと共に, 関連するいくつかの問題に対する最近の話題を, 著者の研究グループが得た成果を中心に紹介する.
In the stable matching problem, we are given a set of men and women, and each person's preference list that orders members of the opposite gender. Our task is to find a matching between men and women that satisfies the "stability" condition. This problem has wide variety of applications in real-world, such as assigning medical students to hospitals, primary school students to secondary schools, and graduate students to supervisors. In this presentation, we introduce the problem and show some elementary properties of the problem. We also show some of recent results on this problem, which are mainly obtained by the authors.
Description: <人工知能と知識処理研究会(AI)> 2009年 9月25日(金) 10:30 - 17:05, 「社会的インタラクションにおける知」および一般 , 京都大学百周年時計台記念館 会議室III
Rights: © 2009 by IEICE
Related Link:
Appears in Collections:Journal Articles

Show full item record

Export to RefWorks

Export Format: 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.