Topological chaos in oligopoly competition
通过Mitra充分条件证明寡头竞争可产生拓扑混沌，并开发基于结式的符号计算方法克服模态点无简单闭式表达的计算难题，发现当企业数量足够大时必存在参数值保证混沌出现。
This letter demonstrates that oligopoly competition can exhibit topological chaos by applying Mitra’s sufficient condition. To overcome the computational challenges arising from the lack of a simple closed-form expression for the modal point, we develop a resultant-based method. Our results show that, for a sufficiently large number of firms, there must exist parameter values that guarantee topological chaos. • We show topological chaos can arise in dynamic oligopoly competition. • A symbolic computation method is proposed to verify Mitra’s sufficient condition. • Our method bypasses computational challenges when modal points lack simple expressions. • Parameter values exist where chaos emerges if the firm number is sufficiently large.