Rchr
J-GLOBAL ID:201601007804595668   Update date: Sep. 02, 2025

TAKAZAWA Kenjiro

タカザワ ケンジロウ | TAKAZAWA Kenjiro
Affiliation and department:
Job title: Professor
Research keywords  (4): Combinatorial Optimization ,  Discrete Mathematics ,  Algorithmic Game Theory ,  Mathematical Engineering
Research theme for competitive and other funds  (11):
  • 2024 - 2029 多面体的手法と離散構造を用いた組合せ最適化問題の解法
  • 2024 - 2029 マトロイド理論を軸とするアルゴリズム的ゲーム理論の体系的な研究
  • 2020 - 2024 マトロイド理論・離散凸解析理論に基づく社会システム解析理論の構築【研究代表者】
  • 2016 - 2020 マッチング、マトロイドと巡回セールスマン問題 【研究代表者】
  • 2013 - 2020 ビッグデータ時代に向けた革新的アルゴリズム基盤【研究分担者】
Show all
Papers (46):
  • Yuga Kanaya, Kenjiro Takazawa. On the equivalence of the graph-structural and optimization-based characterizations of popular matchings. arXiv. 2025
  • Kenjiro Takazawa. Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond. Discrete Applied Mathematics. 2025. 361. 226-235
  • Gergely Csaji, Tamas Kiraly, Kenjiro Takazawa, Yu Yokoi. Popular maximum-utility matching with matroid constraints. Mathematics of Operations Research. 2025
  • Kenjiro Takazawa. A unified model of congestion games with priorities: Two-sided markets with ties, finite and non-affine delay functions, and pure Nash equilibria. Proceedings of the 19th International Conference and Workshops on Algorithms and Computation (WALCOM 2025), Lecture Notes in Computer Science. 2025
  • Yuga Kanaya, Kenjiro Takazawa. A faster deterministic approximation algorithm for TTP-2. Journal of the Operations Research Society of Japan. 2025. 68. 3. 99-123
more...
Books (2):
  • Algorithms in C, Part 5: Graph Algorithms
    2021 ISBN:9784764905665
  • 応用数理ハンドブック
    朝倉書店 2013
Lectures and oral presentations  (65):
  • On the equivalence of the graph-structural and optimization-based characterizations of popular matchings
    (The 18th International Symposium on Algorithmic Game Theory (SAGT 2025) 2025)
  • A unified model of congestion games with priorities
    (The 13th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2025) 2025)
  • A unified model of congestion games with priorities: Two-sided markets with ties, finite and non-affine delay functions, and pure Nash equilibria
    (The 19th International Conference and Workshops on Algorithms and Computation (WALCOM 2025) 2025)
  • Pure Nash equilibria in weighted congestion games with complementarities and beyond
    (The 23rd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2024) 2024)
  • 予算ゲームと混雑ゲームの共通の一般化
    (電子情報通信学会コンピュテーション研究会 2022)
more...
Education (2):
  • 2007 - 2010 The University of Tokyo Graduate School of Information Science and Technology Department of Mathematical Informatics
  • 2005 - 2007 University of Tokyo Graduate School of Information Science and Technology Department of Mathematical Informatics
Professional career (1):
  • Doctor of Information Science and Technology (University of Tokyo)
Work history (3):
  • 2023/04 - 現在 Hosei University Department of Industrial and Systems Engineering, Faculty of Science and Engineering Professor
  • 2016/04 - 2023/03 法政大学 理工学部 経営システム工学科 准教授
  • 2010/04 - 2016/03 Kyoto University Research Institute for Mathematical Sciences Assistant Professor
Committee career (14):
  • 2019/03 - 現在 日本オペレーションズ・リサーチ学会 研究普及委員
  • 2021/04 - 2025/03 日本応用数理学会 論文誌編集委員
  • 2025 - The 13th Hungarian-Japanese Symposium on Discrete Mathenatics and Its Applications (HJ 2025) Program Committee
  • 2018/04 - 2022/03 情報処理学会 アルゴリズム研究会 運営委員
  • 2018 - 2018 The Japanese Conference on Combinatorics and Its Applications (JCCA 2018) Organizing Committee
Show all
Awards (4):
  • 2011/04 - 日本応用数理学会 日本応用数理学会 第 7 回 若手優秀講演賞 制約付き t-マッチングとジャンプシステム: Cunninghamの予想の証明
  • 2010/03 - 日本オペレーションズ・リサーチ学会 日本オペレーションズ・リサーチ学会 第 5 回 文献賞奨励賞 A weighted even factor algorithm, A weighted Kt,t-free t-factor algorithm for bipartite graphs
  • 2007/09 - 日本オペレーションズ・リサーチ学会 日本オペレーションズ・リサーチ学会 第 25 回 学生論文賞 A Unified Approach to Combinatorial Algorithms for Matchings and Matroids
  • 2007/03 - 東京大学 東京大学大学院情報理工学系研究科長賞 A Unified Approach to Combinatorial Algorithms for Matchings and Matroids
Association Membership(s) (2):
日本応用数理学会 ,  日本オペレーションズ・リサーチ学会
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page