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

Yokoi Yu  横井 優

ORCIDConnect your ORCID iD *help
Researcher Number 60805480
Other IDs
Affiliation (Current) 2025: 東京科学大学, 情報理工学院, 准教授
Affiliation (based on the past Project Information) *help 2018 – 2021: 国立情報学研究所, 情報学プリンシプル研究系, 助教
Review Section/Research Field
Principal Investigator
Basic Section 60010:Theory of informatics-related
Keywords
Principal Investigator
最適化 / メカニズムデザイン / ゲーム理論 / 近似アルゴリズム / 組合せ最適化 / アルゴリズム / マッチング
  • Research Projects

    (1 results)
  • Research Products

    (20 results)
  • Co-Researchers

    (2 People)
  •  Evaluation and Optimization of Market Mechanisms Based on Quantitative AnalysisPrincipal Investigator

    • Principal Investigator
      Yokoi Yu
    • Project Period (FY)
      2018 – 2021
    • Research Category
      Grant-in-Aid for Early-Career Scientists
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      National Institute of Informatics

All 2022 2021 2020 2019 2018

All Journal Article Presentation

  • [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

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18004, KAKENHI-PROJECT-20K19743, KAKENHI-PROJECT-20H00605
  • [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

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17H01699, KAKENHI-PROJECT-18K18004
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18004, KAKENHI-PROJECT-16K16005
  • [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
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18004, KAKENHI-PROJECT-17H01699
  • [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
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11839, KAKENHI-PROJECT-18K18004, KAKENHI-PROJECT-16K16012
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K16005, KAKENHI-PROJECT-18K18004
  • [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)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [Presentation] 選好に同順位を含むマッチングモデルでの安定解の最適化2021

    • Author(s)
      横井 優
    • Organizer
      電気通信大学 第38回情報数理工学セミナー
    • Invited
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [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)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [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)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [Presentation] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths2020

    • Author(s)
      横井 優
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Invited
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [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
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18004
  • [Presentation] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths2019

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

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

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

    • Author(s)
      横井 優
    • Organizer
      日本応用数理学会 2018年度年会
    • Data Source
      KAKENHI-PROJECT-18K18004
  • 1.  岩田 覚
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 2.  河瀬 康志
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi