Presentation 2009-09-25
Recent Topics on the Stable Matching Problems
Shuichi MIYAZAKI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) stable marriage problem / approximation algorithms
Paper # AI2009-12
Date of Issue

Conference Information
Committee AI
Conference Date 2009/9/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Recent Topics on the Stable Matching Problems
Sub Title (in English)
Keyword(1) stable marriage problem
Keyword(2) approximation algorithms
1st Author's Name Shuichi MIYAZAKI
1st Author's Affiliation Academic Center for Computing and Media Studies, Kyoto University()
Date 2009-09-25
Paper # AI2009-12
Volume (vol) vol.109
Number (no) 211
Page pp.pp.-
#Pages 4
Date of Issue