• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Research on designing assignment algorithms using stable matchings

Research Project

Project/Area Number 16K00017
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Theory of informatics
Research InstitutionKyoto University

Principal Investigator

MIYAZAKI Shuichi  京都大学, 学術情報メディアセンター, 准教授 (00303884)

Project Period (FY) 2016-04-01 – 2021-03-31
Project Status Completed (Fiscal Year 2020)
Budget Amount *help
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2019: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2018: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2017: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2016: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Keywords安定マッチング / 配属問題 / アルゴリズム理論 / 多項式時間アルゴリズム / 近似アルゴリズム / 計算複雑性 / NP困難性 / 耐戦略性 / 希望リスト / 例題生成 / 非交差マッチング / NP完全性 / 最適化問題 / アルゴリズム / 安定結婚問題 / ゲーム理論 / 情報基礎 / モデル化 / 計算複雑さ
Outline of Final Research Achievements

A matching (or an assignment) that satisfies the property so-called the "stability" based on preferences of participants is called a stable matching. The stable matching problem is widely used in assignment systems, such as assignment of medical doctors to hospitals, school choice, and laboratory assignment in universities. In this research, to widen the applicability of the stable matching problem, we have extended its definition considering applications and analyzed them in a viewpoint of algorithm theory. As a result, we obtained the results on computability/intractability, approximability/inapproximability, strategy-proofness, and instance generation for several models including one allowing ties and incomplete preference lists, one with plural preference lists, and one considering positions of participants on the plane.

Academic Significance and Societal Importance of the Research Achievements

近年社会制度設計(メカニズムデザイン)へのアルゴリズム適用が重要視されており、それを目的としたアルゴリズム的ゲーム理論の分野が急速に発展している。本研究課題が取り扱っている安定マッチングはその中心的トピックであり、得られた成果はアルゴリズム理論だけでなくゲーム理論、経済学等の幅広い分野へ影響を与え得るという意味で学術的意義は大きい。
また本研究課題は、配属における実社会での問題点を解消するためのモデル設計を含んでおり、得られたアルゴリズム等が実社会で利用される可能性を持っている、あるいは配属制度の設計のためのヒントとなり得るという点で社会的意義は大きい。

Report

(6 results)
  • 2020 Annual Research Report   Final Research Report ( PDF )
  • 2019 Research-status Report
  • 2018 Research-status Report
  • 2017 Research-status Report
  • 2016 Research-status Report
  • Research Products

    (19 results)

All 2021 2020 2019 2018 2017 2016 Other

All Int'l Joint Research (1 results) Journal Article (3 results) (of which Peer Reviewed: 3 results,  Open Access: 2 results) Presentation (11 results) (of which Int'l Joint Research: 5 results,  Invited: 1 results) Book (2 results) Remarks (2 results)

  • [Int'l Joint Research] University of Bergen(Norway)

    • Related Report
      2016 Research-status Report
  • [Journal Article] Hardness of Instance Generation with Optimal Solutions for the Stable Marriage Problem2021

    • Author(s)
      Yuki Matsuyama, Shuichi Miyazaki
    • Journal Title

      Journal of Information Processing

      Volume: 29 Issue: 0 Pages: 166-173

    • DOI

      10.2197/ipsjjip.29.166

    • NAID

      130007986874

    • ISSN
      1882-6652
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Jointly stable matchings2019

    • Author(s)
      Shuichi Miyazaki, Kazuya Okamoto
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 38 Issue: 2 Pages: 646-665

    • DOI

      10.1007/s10878-019-00402-4

    • NAID

      120006694230

    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [Journal Article] Finding and analysing the minimum set of driver nodes required to control multilayer networks2019

    • Author(s)
      Nacher Jose C.、Ishitsuka Masayuki、Miyazaki Shuichi、Akutsu Tatsuya
    • Journal Title

      Scientific Reports

      Volume: 9 Issue: 1 Pages: 1-12

    • DOI

      10.1038/s41598-018-37046-z

    • NAID

      120006818694

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Open Access
  • [Presentation] 重み付き木に対する例外付き準平等分割の計算量2021

    • Author(s)
      伊藤 雅士, 宮崎 修一, 中嶋 晋作, 小野 廣隆, 大舘 陽太
    • Organizer
      冬のLAシンポジウム
    • Related Report
      2020 Annual Research Report
  • [Presentation] Strongly Stable and Maximum Weakly Stable Noncrossing Matchings2020

    • Author(s)
      Koki Hamada, Shuichi Miyazaki and Kazuya Okamoto
    • Organizer
      The 31st International Workshop on Combinatorial Algorithms (IWOCA 2020)
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Competitive Analysis for Two Variants of Online Metric Matching Problem2020

    • Author(s)
      Toshiya Itoh, Shuichi Miyazaki, and Makoto Satake
    • Organizer
      The 14th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2020)
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 安定マッチング問題に対するアルゴリズム研究2019

    • Author(s)
      宮崎修一
    • Organizer
      日本OR学会中部支部 若手研究者のためのチュートリアルシンポジウム
    • Related Report
      2019 Research-status Report
    • Invited
  • [Presentation] 安定結婚問題に対する最適解付き例題生成の困難性2019

    • Author(s)
      松山祐貴,宮崎修一
    • Organizer
      2019年度情報処理学会関西支部支部大会
    • Related Report
      2019 Research-status Report
  • [Presentation] Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists2019

    • Author(s)
      Koki Hamada, Shuichi Miyazaki and Hiroki Yanagisawa
    • Organizer
      30th International Symposium on Algorithms and Computation (ISAAC 2019)
    • Related Report
      2019 Research-status Report
    • Int'l Joint Research
  • [Presentation] 複数希望リスト安定結婚問題に対するNP完全性の改良2018

    • Author(s)
      岡本和也,宮崎修一
    • Organizer
      2018年度情報処理学会関西支部支部大会
    • Related Report
      2018 Research-status Report
  • [Presentation] 複数の希望リストを持つ安定結婚問題2018

    • Author(s)
      岡本和也,宮崎修一
    • Organizer
      冬のLAシンポジウム
    • Related Report
      2017 Research-status Report
  • [Presentation] 希望リストを複数持つ安定マッチング問題2017

    • Author(s)
      岡本和也,宮崎修一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Related Report
      2017 Research-status Report
  • [Presentation] Jointly Stable Matchings2017

    • Author(s)
      Shuichi Miyazaki, Kazuya Okamoto
    • Organizer
      International Symposium on Algorithms and Computation (ISAAC)
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Presentation] Total Stability in Stable Matching Games2016

    • Author(s)
      Sushmita Gupta, Kazuo Iwama, and Shuichi Miyazaki
    • Organizer
      The 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
    • Place of Presentation
      レイキャビク(アイスランド)
    • Year and Date
      2016-06-22
    • Related Report
      2016 Research-status Report
    • Int'l Joint Research
  • [Book] 安定マッチングの数理とアルゴリズム ~トラブルのない配属を求めて~2018

    • Author(s)
      宮崎修一
    • Total Pages
      176
    • Publisher
      現代数学社
    • ISBN
      9784768704905
    • Related Report
      2018 Research-status Report
  • [Book] Encyclopedia of Algorithms (2nd Edition)(「Stable Marriage with Ties and Incomplete Lists」の節を分担執筆)2016

    • Author(s)
      Iwama, K. and Miyazaki, S.
    • Total Pages
      5
    • Publisher
      Springer
    • Related Report
      2016 Research-status Report
  • [Remarks] 研究者が作成した研究業績リストのwebページ

    • URL

      https://www.net.ist.i.kyoto-u.ac.jp/members/shuichi/paper.html

    • Related Report
      2020 Annual Research Report
  • [Remarks] 研究業績リスト

    • URL

      http://www.lab2.kuis.kyoto-u.ac.jp/~shuichi/paper.html

    • Related Report
      2018 Research-status Report 2017 Research-status Report 2016 Research-status Report

URL: 

Published: 2016-04-21   Modified: 2022-01-27  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi