Algorithms for Stable Matching Problems toward Real-World Applications / 現実世界での応用に向けた安定マッチング問題のアルゴリズム

Description

京都大学 / 新制・課程博士 / 博士(情報学) / 甲第24030号 / 情博第786号 / 新制||情||133(附属図書館) / 京都大学大学院情報学研究科知能情報学専攻 / (主査)准教授 宮崎 修一, 教授 岡部 寿男, 教授 阿久津 達也, 教授 湊 真一 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

Links & Downloads

1. http://hdl.handle.net/2433/275352
2. 10.14989/doctor.k24030
3. 14301

Tags

algorithm theory

computational complexity

stable matching problems

almost stable matchings

lower quotas

strategy-proofness

noncrossing matchings

007

Additional Fields

Identifer	oai:union.ndltd.org:kyoto-u.ac.jp/oai:repository.kulib.kyoto-u.ac.jp:2433/275352
Date	23 March 2022
Creators	Hamada, Koki
Contributors	濱田, 浩気, ハマダ, コウキ
Publisher	Kyoto University, 京都大学
Source Sets	Kyoto University
Language	English
Detected Language	English
Type	doctoral thesis, Thesis or Dissertation
Rights	This version of the article is an Accepted Manuscript. The formal publication is available online at: http://dx.doi.org/10.1016/j.ipl.2009.06.008"" ""This version of the article is an accepted manuscript. The final publication is available at Springer via http://dx.doi.org/10.1007/s00453-014-9951-z"" ""This is a post-peer-review, pre-copyedit version of an article published in Algorithmica. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00453-021-00832-9"