Decomposition of Path Choice Entropy in General Transport Networks. - Takashi Akamatsu (Transp. Sci., 1997)

An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues. - Takashi Akamatsu (Transp. Sci., 2001)

Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks. - Takashi Akamatsu; Benjamin G. Heydecker (Transp. Sci., 2003)

Self-Organization of LöSCH's Hexagons in Economic agglomeration for Core-periphery Models. - Kiyohiro Ikeda; Kazuo Murota; Takashi Akamatsu (Int. J. Bifurc. Chaos, 2012)

Markovian Traffic Equilibrium Assignment based on Network Generalized Extreme Value Model. - Yuki Oyama; Yusuke Hara; Takashi Akamatsu (CoRR, 2020)

A new look at departure time choice equilibrium models with heterogeneous users. - Takashi Akamatsu; Kentaro Wada; Takamasa Iryo; Shunsuke Hayashi (CoRR, 2020)

Equilibrium refinement for a model of non-monocentric internal structures of cities: A potential game approach. - Minoru Osawa; Takashi Akamatsu (J. Econ. Theory, 2020)

Dynamic traffic assignment in a corridor network: Optimum versus Equilibrium. - Haoran Fu; Takashi Akamatsu; Koki Satsukawa; Kentaro Wada (CoRR, 2021)

Global stability of day-to-day dynamics for schedule-based Markovian transit assignment with boarding queues. - Takashi Akamatsu; Koki Satsukawa; Yuki Oyama (CoRR, 2023)

A fluid-particle decomposition approach to matching market design for crowdsourced delivery systems. - Takashi Akamatsu; Yuki Oyama (CoRR, 2023)

A market-based efficient matching mechanism for crowdsourced delivery systems with demand/supply elasticities. - Yuki Oyama; Takashi Akamatsu (CoRR, 2024)

A Paradox of Telecommuting and Staggered Work Hours in the Bottleneck Model. - Takara Sakai; Takashi Akamatsu; Koki Satsukawa (Transp. Sci., 2024)