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
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)