Abstract
In this paper, we discussed the cofinite sensitivity, shadowing property (SP), P-chaos, and chain mixing of a system induced by symmetric maps (Cournot maps) over a product space , where , , , , G and H are closed subintervals with . The following hold: (1) D is cofinitely sensitive and equivalent to or being sensitive, where , . (2) D possessing an SP is equivalent to both and having an SP. (3) possesses an SP if and only if does as well. (4) D is P-chaotic and equivalent to the maps and being P-chaotic. (5) If D is chain mixing, then both and are chain mixing. (6) If and are chain mixing, then D is chain transitive. Moreover, we extended (1)–(4) to three-dimensional cases.
1. Introduction and Preliminaries
Let and be continuous, where and are closed intervals, and let
be given by , where . They have been studied to present a dynamical analysis of the systems which are induced by cournot duopoly games (see [1]). People think that probably the first chaotic concept in a mathematically rigorous way was presented by Li and Yorke [2]. Since then, people gave many different rigorous concepts of chaos. Each of them tries to depict some kind of unpredictability of a system in the future. Akin and Kolyada presented Li–Yorke sensitivity for the first time [3]. Moreover, they presented the notion of spatio-temporal chaos. Schweizer and Smítal defined the concept of distributional chaos [4]. It is well known that the property of distributional chaos is equivalent to the property having positive topological entropy and some other chaotic concepts for some spaces (see [4,5]) and that this kind of equivalence relationship does not hold for the spaces of higher dimensions [6] and zero dimension [7]. In [8], Wang et al. gave the concept of distributional chaos in a sequence and obtained that this kind of chaotic property is equivalent to Li–Yorke chaotic property for continuous maps over a closed interval. In the past few decades, people always paid very close attention to the study of the dynamic behavior of Cournot maps (see [1,9,10,11,12,13]). From [1,12], there are Markov perfect equilibria processes. Concretely speaking, two fixed players move alternatively such that each of them chooses the best reply to the previous action of another player. Let , and . Obviously, . is called an MPE-set for D (see [9]). At the same time, in [9], Canovas considered a few definitions of chaos for Cournot maps and proved that for each chaotic notion they discussed in [9], D and do not satisfy the same one of them. We know that chaos in Cournot maps has been discussed (see [1,12,13,14,15,16,17]). In [13], Lu and Zhu further explored chaos in Cournot maps. Particularly, they showed that for , and , they have the same some chaotic properties. Inspired by [9,13], in [18], we further studied the chaotic properties of the above Cournot maps. Particularly, we showed that for a continuous map defined by over the space , the following statements hold.
- (1)
- If D satisfies Kato’s concept of chaos, then at least or does.
- (2)
- Suppose that and have Kato’s chaotic property and that the maps t and s satisfy that for any , ifandfor some ( is the set of positive integers), then there is an withand
Then, D has Kato’s chaotic property. In [19], we explored the spatio-temporal chaotic property of a Cournot map on the space . Particularly, it is established that if both s and t are onto maps, then the followings are equivalent: (1) D has the spatio-temporally chaotic property; (2) has the spatio-temporally chaotic property; (3) has the spatio-temporally chaotic property; and (4) has the spatio-temporally chaotic property. At the same time, it is showed that if s and t are onto maps, then has spatio-temporally chaotic property if and only if is as well. In [20], by using the Furstenberg family couple, we studied the -chaos and the strong -chaos of a Cournot map on the product space . In particular, we showed that the following statements hold:
- (1)
- D having the -chaotic property (resp. strong -chaotic property) is equivalent to having the -chaotic property (resp. strong -chaotic property) and also equivalent to having the -chaotic property (resp. strong -chaotic property).
- (2)
- D having the -chaotic property (resp. strong -chaotic property) is equivalent to having the -chaotic property (resp. strong -chaotic property).
- (3)
- is -chaotic (resp. strong -chaotic) if and only if is as well.
Inspired by [18,19,20] and utilizing the methods in them, we will investigate cofinite sensitivity, shadowing property, P-chaos, and chain mixing in duopoly games in this paper. Let a system
over a product space , where , , , , and G and H are closed intervals in . Particularly, it is shown that for any Cournot map over the space , the following hold:
- (1)
- D being cofinitely sensitive is equivalent to or being sensitive.
- (2)
- D possessing an SP is equivalent to and having the SP.
- (3)
- possesses an SP if and only if does as well.
- (4)
- D is P-chaotic if and only if the maps and are P-chaotic.
Moreover, the above results can be extended to the three-dimensional case. For chain mixing, we proved the following:
- (5)
- If D is chain mixing, then both and are chain mixing.
- (6)
- If and are chain mixing, then D is chain transitive.
Meanwhile, inspired by [9,13,18,20,21], we propose several open questions worth exploring.
Let be a metric space. A dynamic system or a map is called sensitive (see [22,23,24]) if one can find an satisfying that for every nonempty open set , one can find two different points satisfying for some integer , where is said to be a sensitivity constant of t. t is cofinitely sensitive (see [25,26]) if there is a such that for any nonempty set , is finite, where
Let be a continuous map of a compact metric space . A sequence is called a pseudo-orbit for t (see [17,25]) if for any integer . By [21,27], for any given , a given sequence is called to be -traced by if for any integer . A map is said to possess the POSP if for each , one can find satisfying that every pseudo-orbit for t can be -traced by some point in G.
A dynamic system or a map having the pseudo-orbit shadowing property (POSP) is said to be P-chaotic if the set of all periodic points of t is dense in G (see [22]).
The following lemma is needed and is from [13].
Lemma 1
(Theorem 3.1 [13]). Assume that and are two compact subintervals and is continuous for any . Then, is -chaotic is equivalent to that so is g, where is -chaotic, where -chaoticity is one of the following chaotic properties: Li–Yorke sensitivity, Li–Yorke chaos, distributional chaos, distributional chaos in a sequence.
2. Cofinite Sensitivity
In [13], the authors show that for any Cournot map D, D has the Li–Yorke sensitive property that is equivalent to that one of the following holding.
- (1)
- has the Li–Yorke sensitive property.
- (2)
- has the Li–Yorke sensitive property.
Inspired by the above result, we obtain the following results.
Theorem 1.
Assume that the metric d over the space is defined as
and the product map of and is defined as
for any and any where and are compact subintervals, and let be a Cournot map. Then, D being cofinitely sensitive is equivalent to one of the following conditions being satisfied.
- (1)
- is sensitive.
- (2)
- is sensitive.
Proof.
Let D be cofinitely sensitive. By Theorem 31 in [25], is cofinitely sensitive, which implies that is sensitive. Since
According to Theorem 3.1 of [13], one can see that or is sensitive. Using Theorem 2 in [21], or is cofinitely sensitive. Without any loss of generality, it is assumed that is cofinitely sensitive. According to the definition, one can find a constant of with satisfying that for every and any , one can find an with and
for any integer some integer . Since s is uniformly continuous, one can find an with
for any with
Clearly,
Hence,
for any integer . This shows that is cofinitely sensitive.
Now, we suppose that is cofinitely sensitive having a sensitivity constant . According to the uniform continuity of s, for the above and any with , one can find some with such that
implies
Consequently, for any with and
if
for any integer and some integer , then
This means that is cofinitely sensitive. Since
by Lemma 3.3 from [25], is cofinitely sensitive. According to Theorem 31 of [25], D is cofinitely sensitive. □
Remark 1.
In Theorem 1, we improve the result of Theorem 2.2 in [18].
Due to the fact that composite mappings satisfy the law of union, when one of the mappings in is an identity mapping, becomes , , or , which is the case in two dimensions. Therefore, it is natural to consider whether the previous results in Section 3 can be extended to three dimensions. Moreover, the n-dimensional situation is similar.
Let be compact subintervals of , and let , , be continuous maps. Define , where . And
Denote
One can obtain that
then, we have conclusions similar to Theorem 1.
Theorem 2.
being cofinitely sensitive is equivalent to one of the following conditions being satisfied.
- (1)
- is sensitive;
- (2)
- is sensitive;
- (3)
- is sensitive.
Proof.
Let be cofinitely sensitive. According to Theorem 31 in [25], is cofinitely sensitive. Then, is sensitive. Since , by Theorem 3.1 in [13], , , or is sensitive. So, by Theorem 2 in [21], , , or is cofinitely sensitive.
Without loss of generality, let be cofinitely sensitive. Then, one can find a constant , where for every and any , there exists a such that
for any integer and some integer . Since t and are uniformly continuous, then one can find two points such that
where and . So,
Hence,
for any integer . This implies that is cofinitely sensitive.
Now, let be cofinitely sensitive, and the sensitive constant is . Since t and are uniformly continuous, if the sensitive constant is and any , one can find a such that implies and So, for any , if for some and any integer , then
This implies that is cofinitely sensitive.
Since , by Lemma 3.3 in [25], is cofinitely sensitive. Then, by Theorem 31 in [25], is cofinitely sensitive. □
3. Shadowing Property (SP) and P-Chaoticity
Theorem 3.
Assume that is a Cournot map. Then, D has an SP that is equivalent to the following being true:
- (1)
- possesses the SP.
- (2)
- possesses the SP.
Proof.
It is known that has an SP that is equivalent to both p and q possessing the SP, and that has an SP equivalent to p possessing the SP. By
we complete the proof of this theorem. □
Theorem 4.
Assume that is a Cournot map. Then, D having dense periodic points is equivalent to both and possessing dense periodic points.
Proof.
Let be the set of all periodic points of a map g over a space X. Clearly,
and
where f is a map of a space Y. By
we complete the proof of this theorem. □
Theorem 5.
Assume that is a Cournot map. If both and possess dense periodic points, then D possesses dense periodic points.
Proof.
Clearly, . Then, both and possessing dense periodic points’ implies that possess dense periodic points. By , D possess dense periodic points. □
Question 1.
Assume that has dense periodic points. Does possess dense periodic points?
Theorem 6.
Assume that is a Cournot map. Then, possessing an SP is equivalent to possessing it as well.
Proof.
Assume that possesses the SP. Let . Since t is uniformly continuous, for the above , one can find an with satisfying the following: if and , then
As possesses the SP, by the definition, there is a with such that any pseudo-orbit for is -traced by some point of H. Since s is uniformly continuous, for the above , there is a with satisfying if and then
Let
be a pseudo-orbit for . Then,
is a pseudo-orbit for . By the definition, there is a satisfying that
for any . So,
for any . Consequently,
for any . By the definition, has the SP. Similarly, it is easy to deduce that if possesses the SP, then so does . □
Question 2.
Let be defined as above.
- (1)
- If and both have the SP, does D also have the SP or vice versa?
- (2)
- If has the SP, does also have the SP or vice versa?
Question 3.
Let be defined as above.
- (1)
- If and both are P-chaotic, is D also P-chaotic or vice versa?
- (2)
- If is P-chaotic, is also P-chaotic or vice versa?
Theorem 7.
Let be a Cournot map. Then, D having the P-chaotic property is equivalent to the maps and having the corresponding property.
Proof.
According to the definition and Theorems 3 and 4, Theorem 7 is true. □
Theorem 8.
having the SP is equivalent to the following being true.
- (1)
- possesses the SP;
- (2)
- possesses the SP;
- (3)
- possesses the SP.
Proof.
It is easy to obtain that possessing the SP is equivalent to , , and all possessing the SP. Since , then conclusions are established. □
Theorem 9.
having dense periodic points is equivalent to , , and all possessing dense periodic points.
Proof.
It is easy to obtain that , where denotes the set of periods of a mapping. Then, if has dense periodic points, then also has this property. And because , then , , and all possess dense periodic points. □
Theorem 10.
possessing the SP is equivalent to possessing the SP as well as possessing the SP.
Proof.
Since , , and by Theorem 6, possessing the SP is equivalent to possessing the SP. So, possessing the SP is equivalent to possessing the SP.
Similarly, since , , and by Theorem 6, possessing the SP is equivalent to possessing the SP. So, possessing the SP is equivalent to possessing the SP.
This complete the proof. □
Theorem 11.
having the P-chaotic property is equivalent to the maps , and having the corresponding property.
Proof.
According to the definition of P-chaos and Theorems 8 and 9, Theorem 11 is true. □
Example 1.
Let , and for any ; then, Theorems 1–11 hold.
4. Chain Mixing
Let be a dynamical system on a metric space . For , an -chain from x to y of length m is a finite sequence such that for . The system or the map s is said to be chain transitive if for any and any two points , there is an -chain from x to y. The system or the map s is said to be -chain mixing if there is some such that for any and any integer , there is an -chain from x to y such that its length is m. The system or the map s is said to be chain mixing if it is -chain mixing for any .
Theorem 12.
Assume that t and s are surjective. Then, is chain mixing if and only if is as well.
Proof.
Assume that is chain mixing. Let . Since t is uniformly continuous, for the above , there is with such that if and , then
As is chain mixing, by the definition, there is an integer such that for any integer and any , one has an -chain of length n from a to b; that is, satisfy that , and
for any
This implies that such that , and
for any
Since t is surjective, by the definition and the above argument, is chain mixing. By a similar argument, one can deduce that if is chain mixing, then so is . □
Theorem 13.
Assume that is a Cournot map, t and s are surjective. Then, the following two statements are true:
- (1)
- If D is chain mixing, then both and are chain mixing.
- (2)
- If and are chain mixing, then D is chain transitive.
Proof.
Assume that D is chain mixing. By Corollary 12 in [28], is chain mixing. By , the chain mixing of and the definition, and is chain mixing. Suppose that is chain mixing. By the hypothesis and Theorem 3.8, is chain mixing. By the definition, one can easily verify that are chain mixing. Let . As s is uniformly continuous, for the above , there is with such that if
and , then
As is chain mixing, by the definition, for the above , there is an integer such that for any integer and any , there is an -chain of length n from a to b; that is, there are which satisfy that , and
for any
By the hypothesis, such that , and
for any
Then, we have
for every integer . As s is surjective, by the hypothesis and the above argument, is chain mixing. Similarly, one can show that if is chain mixing, then so is .
Now, assume that is chain mixing for every , and let . By the definition, there is an integer such that for any integer and any (resp. ), there is an -chain of length n from to (resp. from to ); that is, there are (resp. ) which satisfy that , and (resp. , and ) for any . Then, an -chain
of length from to is obtained. By the hypothesis and the definition, D is chain transitive. □
Question 4.
We do not know if the following are true:
- (1)
- If D is chain transitive, is chain transitive for every ?
- (2)
- If D is chain mixing, is chain mixing for every ?
5. Conclusions
In this research, we studied the sensitivity, shadowing property, P-chaoticity, and chain mixing of duopoly games. Necessary and sufficient conditions for cofinite sensitivity or P-chaoticity or SP of D are obtained. And these conclusions can be extended to a three-dimensional case. Moreover, sufficient conditions for D having dense periodic points or D being chain mixing are given, and some unresolved questions have been raised. In the future, we will continue to study these issues.
Author Contributions
Conceptualization, H.W.; validation, R.L.; formal analysis, P.G.; investigation, P.G.; writing—original draft, H.W.; writing—review and editing, T.L. and R.L.; supervision, T.L.; funding acquisition, H.W. All authors have read and agreed to the published version of the manuscript.
Funding
This research was supported the Key Scientific and Technological Research Project of Science and Technology Department of Zhanjiang City (No. 240418034547512), the Opening Project of Bridge Non-destruction Detecting and Engineering Computing Key Laboratory of Sichuan Province (No. 2018QZJ03), the Opening Project of Artificial Intelligence Key Laboratory of Sichuan Province (No. 2018RZJ03), and the Scientic Research Project of SUSE (No. 2024RC057).
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Acknowledgments
Many thanks to experts and editors.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Puu, T.; Sushko, I. Oligopoly Dynamics: Models and Tools; Springer: New York, NY, USA, 2002. [Google Scholar]
- Li, T.Y.; Yorke, J.A. Period three implies chaos. Am. Math. Mon. 1975, 82, 985–992. [Google Scholar]
- Akin, E.; Kolyada, S. Li-Yorke sensitivity. Nonlinearity 2003, 16, 1421–1433. [Google Scholar]
- Schweizer, B.; Smítal, J. Measures of chaos and a spectral decomposition of dynamical systems on the interval. Trans. Am. Math. Soc. 1994, 344, 737–754. [Google Scholar]
- Oprocha, P.; Wilczyński, P. Shift spaces and distributional chaos. Chaos Soliton. Fract. 2007, 31, 347–355. [Google Scholar]
- Smítal, J.; Stefánkovxax, M. Distributional chaos for triangular maps. Chaos Soliton. Fract. 2004, 21, 1125–1128. [Google Scholar]
- Pikula, R. On some notions of chaos in dimension zero. Colloq. Math. 2007, 107, 167–177. [Google Scholar]
- Wang, L.D.; Huang, G.F.; Huan, S.M. Distributional chaos in a sequence. Nonlinear Anal. 2007, 67, 2131–2136. [Google Scholar]
- Cánovas, J.S.; Marín, M.R. Chaos on MPE-sets of duopoly game. Chaos Soliton. Fract. 2004, 19, 179–183. [Google Scholar]
- Askar, S.S. On the dynamics of Cournot duopoly game with private firms: Investigations and analysis. Appl. Math. Comput. 2022, 432, 127352. [Google Scholar]
- Wu, W.J.; Chen, Z.Q.; Ip, W.H. Complex nonlinear dynamics and controlling chaos in a Cournot duopoly economic model. Nonlinear Anal. 2010, 11, 4363–4377. [Google Scholar]
- Dana, R.A.; Montrucchio, L. Dynamic complexity in duopoly games. J. Econ. Theory 1986, 44, 40–56. [Google Scholar] [CrossRef]
- Lu, T.X.; Zhu, P.Y. Further discussion on chaos in duopoly games. Chaos Soliton. Fract. 2013, 52, 45–48. [Google Scholar] [CrossRef]
- Kartal, S. A discrete fractional order cournot duopoly game model with relative profit delegation: Stability, bifurcation, chaos, 0–1 testing and control. J. Comput. Appl. Math. 2025, 457, 116284. [Google Scholar] [CrossRef]
- Ahmed, R.; Qureshi, M.Z.A.; Abbas, M.; Mumtaz, N. Bifurcation and chaos control in a heterogeneous Cournot-Bertrand duopoly game model. Chaos Soliton. Fract. 2025, 190, 115757. [Google Scholar] [CrossRef]
- Peng, Y.; Xiao, Y.; Lu, Q. Chaotic dynamics in Cournot duopoly model with bounded rationality based on relative profit delegation maximization. Physica A 2020, 560, 125174. [Google Scholar] [CrossRef]
- Rand, D. Exotic phenomena in games and doupoly models. J. Math. Econ. 1978, 5, 173–184. [Google Scholar] [CrossRef]
- Li, R.S.; Wang, H.Q.; Zhao, Y. Kato’s chaos in duopoly games. Chaos Soliton. Fract. 2016, 84, 69–72. [Google Scholar] [CrossRef]
- Fuentes, M.A.; Sato, Y.; Tsallis, C. Sensitivity to initial conditions, entropy production, and escape rate at the onset of chaos. Phys. Lett. A 2011, 375, 2988–2991. [Google Scholar] [CrossRef]
- Zhao, Y.; Li, R.S. Chaos in Duopoly Games via Furstenberg Family Couple. Complexity 2019, 1, 5484629. [Google Scholar] [CrossRef]
- Arai, T.; Chinen, N. P-chaos implies distributional chaos and chaos in the sense of Devaney with positive topological entropy. Topol. Appl. 2007, 154, 1254–1262. [Google Scholar] [CrossRef][Green Version]
- Li, R.S.; Lu, T.X.; Chen, G.R.; Liu, G. Some stronger forms of topological transitivity and sensitivity for a sequence of uniformly convergent continuous maps. J. Math. Anal. Appl. 2021, 494, 124443. [Google Scholar] [CrossRef]
- Mahajan, A.; Thakur, R.; Das, R. Sensitivity in hyperspatial and product systems via Furstenberg families. Topol. Appl. 2024, 349, 108907. [Google Scholar] [CrossRef]
- Wu, X.X.; Wang, J.J.; Chen, G.R. F-sensitivity and multi-sensitivity of hyperspatial dynamical systems. J. Math. Anal. Appl. 2015, 429, 16–26. [Google Scholar] [CrossRef]
- Li, R.S.; Shi, Y.M. Stronger forms of sensitivity for measure-preserving maps and semi-flows on probability spaces. Abstr. Appl. Anal. 2014, 1, 769523. [Google Scholar]
- Moothathu, T.K.S. Stronger forms of sensitivity for dynamical systems. Nonlinearity 2007, 20, 2115–2126. [Google Scholar] [CrossRef]
- Aoki, N. Topological dynamics. In Topics in General Topology; North-Holland Mathematic Library: Amsterdam, The Netherlands, 1989; Volume 41. [Google Scholar]
- Richeson, D.; Wiseman, J. Chain recurrence rates and topological entropy. Topol. Appl. 2008, 156, 251–261. [Google Scholar] [CrossRef][Green Version]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).