This paper explores the stability of coalition partitions in dynamic games, specifically introducing a concept of dynamically stable Nash coalition partition for dynamic games. We focus on a Nash equilibrium where coalitions act as unified players and discuss dynamic stability, where players have no incentive to switch coalitions. A case study on “fish wars” illustrates conditions under which dynamic stability occurs, utilizing a time-consistent imputation distribution procedure to allocate payoffs along optimal trajectories.