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

Evaluation and Optimization of Market Mechanisms Based on Quantitative Analysis

Research Project

Project/Area Number 18K18004
Research Category

Grant-in-Aid for Early-Career Scientists

Allocation TypeMulti-year Fund
Review Section Basic Section 60010:Theory of informatics-related
Research InstitutionNational Institute of Informatics

Principal Investigator

Yokoi Yu  国立情報学研究所, 情報学プリンシプル研究系, 助教 (60805480)

Project Period (FY) 2018-04-01 – 2022-03-31
Project Status Completed (Fiscal Year 2021)
Budget Amount *help
¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2021: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2020: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2019: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2018: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Keywordsマッチング / アルゴリズム / 組合せ最適化 / 近似アルゴリズム / ゲーム理論 / メカニズムデザイン / 最適化
Outline of Final Research Achievements

In this research, we analyzed the mathematical model of matching markets involving agents with preferences from the viewpoints of combinatorial optimization and game theory. For a matching model with lower quotas, for which the existence of a stable matching is not guaranteed, we take approaches such as relaxation of the solution concept and satisfying lower quotas approximately, and design efficient algorithms that achieve the desired properties in an approximate sense. In addition, we proposed and analyzed a decentralized matching model in which matching is formed by participants making successive decisions, and clarified the computational complexity and the conditions for the obtained matching to satisfy stability.

Academic Significance and Societal Importance of the Research Achievements

選好をともなうマッチングモデルはこれまでにも盛んに研究がなされており,既に数多くの応用例をもつ.しかし実社会の問題の中には,その背景に起因した様々な付加的な要請をもつものや,既存のモデルの範疇を超えるものも数多く存在する.そしてそれらは,問題の構造上解をもたなかったり,計算量的な困難性を有していたりする.本研究で得られた新しいモデルに対する解析結果や,困難な問題に対する近似的な解法は,マッチング理論の応用可能性を高めることに貢献し得る.

Report

(5 results)
  • 2021 Annual Research Report   Final Research Report ( PDF )
  • 2020 Research-status Report
  • 2019 Research-status Report
  • 2018 Research-status Report
  • Research Products

    (21 results)

All 2022 2021 2020 2019 2018 Other

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

  • [Int'l Joint Research] Eotvos Lorand University(ハンガリー)

    • Related Report
      2021 Annual Research Report
  • [Journal Article] Approximation by lexicographically maximal solutions in matching and matroid intersection problems2022

    • Author(s)
      Kristof Berczi, Tamas Kiraly, Yutaro Yamaguchi, Yu Yokoi
    • Journal Title

      Theoretical Computer Science

      Volume: 910 Pages: 48-53

    • DOI

      10.1016/j.tcs.2022.01.035

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties2022

    • Author(s)
      Hiromichi Goko,Kazuhisa Makino,Shuichi Miyazaki,Yu Yokoi
    • Journal Title

      Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)

      Volume: null

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Equitable partitions into matchings and coverings in mixed graphs2022

    • Author(s)
      Tamas Kiraly, Yu Yokoi
    • Journal Title

      Discrete Mathematics

      Volume: 345 Issue: 1 Pages: 112651-112651

    • DOI

      10.1016/j.disc.2021.112651

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints2021

    • Author(s)
      Yu Yokoi
    • Journal Title

      Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021)

      Volume: null

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A NOTE ON A NEARLY UNIFORM PARTITION INTO COMMON INDEPENDENT SETS OF TWO MATROIDS2020

    • Author(s)
      Fujishige Satoru、Takazawa Kenjiro、Yokoi Yu
    • Journal Title

      Journal of the Operations Research Society of Japan

      Volume: 63 Issue: 3 Pages: 71-77

    • DOI

      10.15807/jorsj.63.71

    • NAID

      130007882296

    • ISSN
      0453-4514, 2188-8299
    • Year and Date
      2020-07-31
    • Related Report
      2020 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Envy-Free Matchings with Lower Quotas2020

    • Author(s)
      Yokoi Yu
    • Journal Title

      Algorithmica

      Volume: 82 Issue: 2 Pages: 188-211

    • DOI

      10.1007/s00453-018-0493-7

    • Related Report
      2020 Research-status Report
    • Peer Reviewed
  • [Journal Article] Finding a Stable Allocation in Polymatroid Intersection2020

    • Author(s)
      Satoru Iwata, Yu Yokoi
    • Journal Title

      Mathematics of Operations Research

      Volume: 45 Issue: 1 Pages: 63-85

    • DOI

      10.1287/moor.2018.0976

    • Related Report
      2020 Research-status Report
    • Peer Reviewed
  • [Journal Article] Subgame Perfect Equilibria of Sequential Matching Games2020

    • Author(s)
      Kawase Yasushi、Yamaguchi Yutaro、Yokoi Yu
    • Journal Title

      ACM Transactions on Economics and Computation

      Volume: 7 Issue: 4 Pages: 1-30

    • DOI

      10.1145/3373717

    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [Journal Article] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths2020

    • Author(s)
      Iwata Satoru、Yokoi Yu
    • Journal Title

      Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms

      Volume: - Pages: 1933-1944

    • DOI

      10.1137/1.9781611975994.119

    • ISBN
      9781611975994
    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [Journal Article] Computing a Subgame Perfect Equilibrium of a Sequential Matching Game2018

    • Author(s)
      Kawase Yasushi、Yamaguchi Yutaro、Yokoi Yu
    • Journal Title

      Proceedings of the 2018 ACM Conference on Economics and Computation

      Volume: - Pages: 131-148

    • DOI

      10.1145/3219166.3219200

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Presentation] Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties2022

    • Author(s)
      Yu Yokoi
    • Organizer
      The 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 選好に同順位を含むマッチングモデルでの安定解の最適化2021

    • Author(s)
      横井 優
    • Organizer
      電気通信大学 第38回情報数理工学セミナー
    • Related Report
      2021 Annual Research Report
    • Invited
  • [Presentation] Approximability vs. Strategy-proofness in Stable Matching Problems with Ties2021

    • Author(s)
      Yu Yokoi
    • Organizer
      Dagstuhl Seminar (on Matching Under Preferences: Theory and Practice)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints2021

    • Author(s)
      Yu Yokoi
    • Organizer
      The 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths2020

    • Author(s)
      横井 優
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2020 Research-status Report
    • Invited
  • [Presentation] Equitable Partitions into Matchings and Coverings in Mixed Graphs2019

    • Author(s)
      Yu Yokoi
    • Organizer
      The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Related Report
      2019 Research-status Report
    • Int'l Joint Research
  • [Presentation] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths2019

    • Author(s)
      横井 優
    • Organizer
      Japanese Conference on Combinatorics and its Applications (JCCA 2019) 離散数学とその応用研究集会2019
    • Related Report
      2019 Research-status Report
  • [Presentation] Computing a Subgame Perfect Equilibrium of a Sequential Matching Game2018

    • Author(s)
      Yu Yokoi
    • Organizer
      The 19th ACM Conference on Economics and Computation
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] 安定マッチング理論と展開型マッチングゲーム2018

    • Author(s)
      横井 優
    • Organizer
      第17回情報科学技術フォーラム
    • Related Report
      2018 Research-status Report
    • Invited
  • [Presentation] 展開型マッチングゲームにおける部分ゲーム完全均衡2018

    • Author(s)
      横井 優
    • Organizer
      日本応用数理学会 2018年度年会
    • Related Report
      2018 Research-status Report

URL: 

Published: 2018-04-23   Modified: 2023-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi