Next Article in Journal
Reflections on Chiral Symmetry Within QCD
Previous Article in Journal
Bluff Body Size Parameters and Vortex Flowmeter Performance: A Big Data-Based Modeling and Machine Learning Methodology
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Sensitivity, Shadowing Property and P-Chaos in Duopoly Games

1
School of Mathematics and Computer Science, Guangdong Ocean University, Zhanjiang 524025, China
2
College of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong 643000, China
3
Bridge Non-destruction Detecting and Engineering Computing Key Laboratory of Sichuan Province, Zigong 643000, China
*
Authors to whom correspondence should be addressed.
Symmetry 2025, 17(4), 511; https://doi.org/10.3390/sym17040511
Submission received: 5 January 2025 / Revised: 31 January 2025 / Accepted: 24 March 2025 / Published: 28 March 2025
(This article belongs to the Section Mathematics)

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) D ( a , b ) = ( t ( b ) , s ( a ) ) over a product space G × H , where s : G H , t : H G , a G , b H , G and H are closed subintervals with G , H R . The following hold: (1) D is cofinitely sensitive and equivalent to D 2 | Γ 1 or D 2 | Γ 2 being sensitive, where Γ 1 = { ( t ( b ) , b ) : b H } , Γ 2 = { ( a , s ( a ) ) : a G } . (2) D possessing an SP is equivalent to both s t and t s having an SP. (3) t s possesses an SP if and only if s t does as well. (4) D is P-chaotic and equivalent to the maps s t and t s being P-chaotic. (5) If D is chain mixing, then both D 2 | Γ 1 and D 2 | Γ 2 are chain mixing. (6) If D 2 | Γ 1 and D 2 | Γ 2 are chain mixing, then D is chain transitive. Moreover, we extended (1)–(4) to three-dimensional cases.

1. Introduction and Preliminaries

Let t : H G and s : G H be continuous, where G R and H R are closed intervals, and let
D : G × H G × H
be given by D ( a , b ) = ( t ( b ) , s ( a ) ) , where ( a , b ) G × F . 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 Γ 1 = { ( t ( b ) , b ) : b H } , Γ 2 = { ( a , s ( a ) ) : a G } and Γ 12 = Γ 1 Γ 2 . Obviously, D ( Γ 12 ) Γ 12 . Γ 12 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 D | Γ 12 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 D | Γ 12 , D 2 | Γ 1 and D 2 | Γ 2 , 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 D ( a , b ) = ( t ( b ) , s ( a ) ) over the space G × H , the following statements hold.
(1)
If D satisfies Kato’s concept of chaos, then at least D 2 | Γ 1 or D 2 | Γ 2 does.
(2)
Suppose that D 2 | Γ 1 and D 2 | Γ 2 have Kato’s chaotic property and that the maps t and s satisfy that for any ε > 0 , if
( s t ) l ( v 1 ) ( s t ) l ( v 2 ) < ε
and
( t s ) k ( u 1 ) ( t s ) k ( u 2 ) < ε
for some l , k Z + ( Z + is the set of positive integers), then there is an m ( l , k , ε ) Z + with
( s t ) m ( l , k , ε ) ( v 1 ) ( s t ) m ( l , k , ε ) ( v 2 ) < ε ;
and
( t s ) m ( l , k , ε ) ( u 1 ) ( t s ) m ( l , k , ε ) ( u 2 ) < ε .
Then, D has Kato’s chaotic property. In [19], we explored the spatio-temporal chaotic property of a Cournot map D ( a , b ) = ( t ( b ) , s ( a ) ) on the space G × H . 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) D 2 | Γ 1 has the spatio-temporally chaotic property; (3) D 2 | Γ 2 has the spatio-temporally chaotic property; and (4) D 2 | Γ 1 Γ 2 has the spatio-temporally chaotic property. At the same time, it is showed that if s and t are onto maps, then s t has spatio-temporally chaotic property if and only if t s is as well. In [20], by using the Furstenberg family couple, we studied the ( F 1 , F 2 ) -chaos and the strong ( F 1 , F 2 ) -chaos of a Cournot map D ( a , b ) = ( t ( b ) , s ( a ) ) on the product space G × H . In particular, we showed that the following statements hold:
(1)
D having the ( F 1 , F 2 ) -chaotic property (resp. strong ( F 1 , F 2 ) -chaotic property) is equivalent to D 2 | Λ 1 having the ( F 1 , F 2 ) -chaotic property (resp. strong ( F 1 , F 2 ) -chaotic property) and also equivalent to D 2 | Λ 2 having the ( F 1 , F 2 ) -chaotic property (resp. strong ( F 1 , F 2 ) -chaotic property).
(2)
D having the ( F 1 , F 2 ) -chaotic property (resp. strong ( F 1 , F 2 ) -chaotic property) is equivalent to F 2 | Λ 1 Λ 2 having the ( F 1 , F 2 ) -chaotic property (resp. strong ( F 1 , F 2 ) -chaotic property).
(3)
t s is ( F 1 , F 2 ) -chaotic (resp. strong ( F 1 , F 2 ) -chaotic) if and only if s t 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
D ( a , b ) = ( t ( b ) , s ( a ) )
over a product space G × H , where s : G H , t : H G , a G , b H , and G and H are closed intervals in R . Particularly, it is shown that for any Cournot map D ( a , b ) = ( t ( b ) , s ( a ) ) over the space G × H , the following hold:
(1)
D being cofinitely sensitive is equivalent to D 2 | Γ 1 or D 2 | Γ 2 being sensitive.
(2)
D possessing an SP is equivalent to s t and t s having the SP.
(3)
t s possesses an SP if and only if s t does as well.
(4)
D is P-chaotic if and only if the maps s t and t s 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 D 2 | Γ 1 and D 2 | Γ 2 are chain mixing.
(6)
If D 2 | Γ 1 and D 2 | Γ 2 are chain mixing, then D is chain transitive.
Meanwhile, inspired by [9,13,18,20,21], we propose several open questions worth exploring.
Let ( G , d ) be a metric space. A dynamic system ( G , d , t ) or a map t : G G is called sensitive (see [22,23,24]) if one can find an λ > 0 satisfying that for every nonempty open set W G : W , one can find two different points a , b W satisfying d ( t k ( a ) , t k ( b ) ) > λ for some integer k > 0 , where λ is said to be a sensitivity constant of t. t is cofinitely sensitive (see [25,26]) if there is a δ > 0 such that for any nonempty set A G , Z + N t ( A , δ ) is finite, where
N t ( A , δ ) = { m Z + : there exist a , b A satisfying | a b | > δ } .
Let t : G G be a continuous map of a compact metric space ( G , d ) . A sequence { u j : j 0 } G is called a δ pseudo-orbit for t (see [17,25]) if d ( t ( u j ) , u j + 1 ) < δ for any integer j 0 . By [21,27], for any given ε > 0 , a given sequence { u j : j 0 } G is called to be ε -traced by u G if d ( t j ( u ) , u j ) < λ for any integer j 0 . A map t : G G is said to possess the POSP if for each ε > 0 , one can find δ > 0 satisfying that every δ pseudo-orbit for t can be ε -traced by some point in G.
A dynamic system ( G , d , t ) or a map t : G G having the pseudo-orbit shadowing property (POSP) is said to be P-chaotic if the set P ( t ) 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 J 1 R and J 2 R are two compact subintervals and g j : J j J j is continuous for any j { 1 , 2 } . Then, g 1 × g 2 is Q -chaotic is equivalent to that so is g, where g { g 1 , g 2 } is Q -chaotic, where Q -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)
D 2 | Γ 1 has the Li–Yorke sensitive property.
(2)
D 2 | Γ 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 G × H is defined as
d ( ( a 1 , b 1 ) , ( a 2 , b 2 ) ) = max { | a 2 a 1 | , | b 2 b 1 | }
and the product map s × t of s : G G and t : H H is defined as
( s × t ) ( a , b ) = ( s ( a ) , t ( b ) )
for any a G and any b H where G R and H R are compact subintervals, and let D ( a , b ) = ( t ( b ) , s ( a ) ) be a Cournot map. Then, D being cofinitely sensitive is equivalent to one of the following conditions being satisfied.
(1) 
D 2 | Γ 1 is sensitive.
(2) 
D 2 | Γ 2 is sensitive.
Proof. 
Let D be cofinitely sensitive. By Theorem 31 in [25], D 2 is cofinitely sensitive, which implies that D 2 is sensitive. Since
D 2 = ( t s ) × ( s t ) ,
According to Theorem 3.1 of [13], one can see that t s or s t is sensitive. Using Theorem 2 in [21], t s or s t is cofinitely sensitive. Without any loss of generality, it is assumed that t s is cofinitely sensitive. According to the definition, one can find a constant δ > 0 of t s with δ < δ satisfying that for every a G and any η > 0 , one can find an b η G with | a b η | < η and
| ( t s ) n ( a ) ( t s ) n ( b η ) | > δ
for any integer n m some integer m > 0 . Since s is uniformly continuous, one can find an η 1 ( 0 , η ) with
| s ( a 1 ) s ( a 2 ) | < η
for any a 1 , a 2 G with
| a 1 a 2 | < η 1 .
Clearly,
d ( ( a , s ( a ) ) , ( b η 1 , s ( b η 1 ) ) ) < η .
Hence,
d ( D 2 n ( a , s ( a ) ) , D 2 n ( b η 1 , s ( b η 1 ) ) ) | ( t s ) n ( a ) ( t s ) n ( b η 1 ) | > δ
for any integer n m . This shows that D 2 | Γ 2 is cofinitely sensitive.
Now, we suppose that D 2 | Γ 2 is cofinitely sensitive having a sensitivity constant δ > 0 . According to the uniform continuity of s, for the above δ > 0 and any a 1 , a 2 G with a 1 a 2 , one can find some δ > 0 with δ < δ such that
| a 1 a 2 | δ
implies
| s ( a 1 ) s ( a 2 ) | δ .
Consequently, for any a 1 , a 2 G with a 1 a 2 and
| a 1 a 2 | δ ,
if
d ( D 2 n ( a 1 , s ( a 1 ) ) , a 2 , s ( a 2 ) ) ) > δ
for any integer n m and some integer m > 0 , then
| ( t s ) n ( a 1 ) ( t s ) n ( a 2 ) ) | > δ .
This means that t s is cofinitely sensitive. Since
D 2 = ( t s ) × ( s t ) ,
by Lemma 3.3 from [25], D 2 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 s φ t is an identity mapping, s φ t becomes s t , φ t , or s φ , 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 G , F , H be compact subintervals of R , and let t : G F , φ : F H , s : H G be continuous maps. Define D ˜ ( a , b , c ) = ( s ( c ) , t ( b ) , φ ( a ) ) , where ( a , b , c ) G × F × H . And
d ( ( a 1 , b 1 , c 1 ) , ( a 2 , b 2 , c 2 ) ) = max { | a 2 a 1 | , | b 2 b 1 | , | c 2 c 1 | } .
Denote
Γ ˜ 1 = { a , t ( a ) , φ t ( a ) : a G } ;
Γ ˜ 2 = { s φ ( b ) , b , φ ( b ) : b F } ;
Γ ˜ 3 = { } s ( c ) , t s ( c ) , φ t s ( c ) : c H } .
One can obtain that
D ˜ 3 = ( s φ t ) × ( t s φ ) × ( φ t s ) ,
then, we have conclusions similar to Theorem 1.
Theorem 2. 
D ˜ being cofinitely sensitive is equivalent to one of the following conditions being satisfied.
(1) 
D ˜ 3 | Γ ˜ 1 is sensitive;
(2) 
D ˜ 3 | Γ ˜ 2 is sensitive;
(3) 
D ˜ 3 | Γ ˜ 3 is sensitive.
Proof. 
Let D ˜ be cofinitely sensitive. According to Theorem 31 in [25], D ˜ 3 is cofinitely sensitive. Then, D ˜ 3 is sensitive. Since D ˜ 3 = ( s φ t ) × ( t s φ ) × ( φ t s ) , by Theorem 3.1 in [13], s φ t , t s φ , or φ t s ) is sensitive. So, by Theorem 2 in [21], s φ t , t s φ , or φ t s ) is cofinitely sensitive.
Without loss of generality, let s φ t be cofinitely sensitive. Then, one can find a constant δ * : 0 < δ * < δ , where for every a G and any η > 0 , there exists a b η G : | a b η | < η such that
| ( s φ t ) n ( a ) ( s φ t ) n ( b η ) | > δ *
for any integer n m and some integer m > 0 . Since t and φ t are uniformly continuous, then one can find two points η 1 , η 2 ( 0 , η ) such that
| t ( a 1 ) t ( a 2 ) | < η , | ( φ t ) ( a 1 ) ( φ t ) ( a 2 ) | < η 2 ,
where a 1 , a 2 G and | a 1 a 2 | < η . So,
d [ ( a , t ( a ) , ( φ t ) ( a ) ) , ( b η 1 , t ( b η 1 ) , ( φ t ) ( b η 1 ) ) ] < η .
Hence,
d [ D ˜ 3 n ( a , t ( a ) , ( φ t ) ( a ) ) , D ˜ 3 n ( b η 1 , t ( b η 1 ) , ( φ t ) ( b η 1 ) ) ] | ( t φ s ) ( a ) ( t φ s ) ( b η 1 ) | > δ *
for any integer n m . This implies that D ˜ 3 | Γ ˜ 1 is cofinitely sensitive.
Now, let D ˜ 3 | Γ ˜ 1 be cofinitely sensitive, and the sensitive constant is δ > 0 . Since t and φ t are uniformly continuous, if the sensitive constant is δ > 0 and any a 1 , a 2 G : a 1 a 2 , one can find a δ : 0 < δ < δ such that | a 1 a 2 | δ implies | t ( a 1 ) t ( a 2 ) | δ and | ( φ t ) ( a 1 ) ( φ t ) ( a 2 ) | δ . So, for any a 1 , a 2 G : 0 < | a 1 a 2 | δ , if d [ D ˜ 3 ( a 1 , t ( a 1 ) , ( φ t ) ( a 1 ) , ( a 2 , t ( a 2 ) , ( φ t ) ( a 2 ) ) ] > δ for some m > 0 and any integer n : n m , then
| ( s φ t ) n ( a 1 ) ( s φ t ) n ( a 2 ) | > δ .
This implies that s φ t is cofinitely sensitive.
Since D ˜ 3 = ( s φ t ) × ( t s φ ) × ( φ t s ) , by Lemma 3.3 in [25], D ˜ 3 is cofinitely sensitive. Then, by Theorem 31 in [25], D ˜ is cofinitely sensitive. □

3. Shadowing Property (SP) and P-Chaoticity

Theorem 3. 
Assume that D ( a , b ) = ( t ( b ) , s ( a ) ) is a Cournot map. Then, D has an SP that is equivalent to the following being true:
(1) 
s t possesses the SP.
(2) 
t s possesses the SP.
Proof. 
It is known that p × q has an SP that is equivalent to both p and q possessing the SP, and that p 2 has an SP equivalent to p possessing the SP. By
D 2 = ( t s ) × ( s t ) ,
we complete the proof of this theorem. □
Theorem 4. 
Assume that D ( a , b ) = ( t ( b ) , s ( a ) ) is a Cournot map. Then, D having dense periodic points is equivalent to both s t and t s possessing dense periodic points.
Proof. 
Let P ( g ) be the set of all periodic points of a map g over a space X. Clearly,
P ( g 2 ) = P ( g )
and
P ( g × f ) = P ( g ) × P ( f ) ,
where f is a map of a space Y. By
D 2 = ( t s ) × ( s t ) ,
we complete the proof of this theorem. □
Theorem 5. 
Assume that D ( a , b ) = ( t ( b ) , s ( a ) ) is a Cournot map. If both D 2 | Γ 1 and D 2 | Γ 2 possess dense periodic points, then D possesses dense periodic points.
Proof. 
Clearly, P ( D 2 | Γ 1 ) P ( D 2 | Γ 2 ) P ( D 2 ) . Then, both D 2 | Γ 1 and D 2 | Γ 2 possessing dense periodic points’ implies that D 2 possess dense periodic points. By P ( D 2 ) = P ( D ) , D possess dense periodic points. □
Question 1. 
Assume that D ( a , b ) = ( t ( b ) , s ( a ) ) has dense periodic points. Does D 2 | Γ i ( i = 1 , 2 ) possess dense periodic points?
Theorem 6. 
Assume that D ( a , b ) = ( t ( b ) , s ( a ) ) is a Cournot map. Then, t s possessing an SP is equivalent to s t possessing it as well.
Proof. 
Assume that s t possesses the SP. Let η > 0 . Since t is uniformly continuous, for the above η > 0 , one can find an η > 0 with η < 1 2 η satisfying the following: if b 1 , b 2 H and | b 1 b 2 | < η , then
| t ( b 1 ) t ( b 2 ) | < 1 2 η .
As s t possesses the SP, by the definition, there is a δ > 0 with δ η such that any δ pseudo-orbit for s t is η -traced by some point of H. Since s is uniformly continuous, for the above δ > 0 , there is a δ > 0 with δ < δ satisfying if a 1 , a 2 G and | a 1 a 2 | < δ then
| s ( a 1 ) s ( a 2 ) | < δ .
Let
{ a k } k 0 G
be a δ pseudo-orbit for t s . Then,
{ s ( a k ) } k 0 H
is a δ pseudo-orbit for s t . By the definition, there is a b H satisfying that
| ( s t ) k ( b ) s ( a k ) | < η
for any k 0 . So,
| ( t s ) k ( t ( b ) ) ( t s ) ( a k ) | < 1 2 η
for any k 0 . Consequently,
| ( t s ) k 1 ( t s t ) ( b ) a k 1 |
| ( t s ) k ( t ( b ) ) ( t s ) ( a k ) | + | ( t s ) ( a k ) a k 1 | < 1 2 η + δ < η
for any k 1 . By the definition, t s has the SP. Similarly, it is easy to deduce that if t s possesses the SP, then so does s t . □
Question 2. 
Let D , D 2 , Γ 1 , Γ 2 be defined as above.
(1) 
If  D 2 | Γ 1  and  D 2 | Γ 2  both have the SP, does D also have the SP or vice versa?
(2) 
If  D 2 | Γ 1  has the SP, does  D 2 | Γ 2  also have the SP or vice versa?
Question 3. 
Let  D , D 2 , Γ 1 , Γ 2  be defined as above.
(1) 
If  D 2 | Γ 1  and  D 2 | Γ 2  both are P-chaotic, is D also P-chaotic or vice versa?
(2) 
If  D 2 | Γ 1  is P-chaotic, is  D 2 | Γ 2  also P-chaotic or vice versa?
Theorem 7. 
Let D ( a , b ) = ( t ( b ) , s ( a ) ) be a Cournot map. Then, D having the P-chaotic property is equivalent to the maps s t and t s having the corresponding property.
Proof. 
According to the definition and Theorems 3 and 4, Theorem 7 is true. □
Theorem 8. 
D ˜ having the SP is equivalent to the following being true.
(1) 
s φ t possesses the SP;
(2) 
t s φ possesses the SP;
(3) 
φ t s possesses the SP.
Proof. 
It is easy to obtain that ( s φ t ) × ( t s φ ) × ( φ t s ) possessing the SP is equivalent to s φ t , t s φ , and φ t s all possessing the SP. Since D ˜ 3 = ( s φ t ) × ( t s φ ) × ( φ t s ) , then conclusions are established. □
Theorem 9. 
D ˜ having dense periodic points is equivalent to s φ t , t s φ , and φ t s all possessing dense periodic points.
Proof. 
It is easy to obtain that P ( D ˜ 3 | Γ ˜ 1 ) P ( D ˜ 3 | Γ ˜ 2 ) P ( D ˜ 3 | Γ ˜ 3 ) P ( D ˜ 3 ) , where P ( · ) denotes the set of periods of a mapping. Then, if D ˜ 3 | Γ ˜ i ( i = 1 , 2 , 3 ) has dense periodic points, then D ˜ 3 also has this property. And because P ( D ˜ 3 ) = P ( D ˜ ) , then s φ t , t s φ , and φ t s all possess dense periodic points. □
Theorem 10. 
s φ t possessing the SP is equivalent to t s φ possessing the SP as well as φ t s possessing the SP.
Proof. 
Since s φ t = ( s φ ) t , t s φ = t ( s φ ) , and by Theorem 6, ( s φ ) t possessing the SP is equivalent to t ( s φ ) possessing the SP. So, s φ t possessing the SP is equivalent to t s φ possessing the SP.
Similarly, since s φ t = s ( φ t ) , φ t s = ( φ t ) s , and by Theorem 6, s ( φ t ) possessing the SP is equivalent to ( φ t ) s possessing the SP. So, s φ t possessing the SP is equivalent to φ t s possessing the SP.
This complete the proof. □
Theorem 11. 
D ˜ having the P-chaotic property is equivalent to the maps s φ t t s φ , and φ t s having the corresponding property.
Proof. 
According to the definition of P-chaos and Theorems 8 and 9, Theorem 11 is true. □
Example 1. 
Let f ( a ) = 1 | 1 2 a | , a [ 0 , 1 ] , and s ( a ) = φ ( a ) = t ( a ) = f ( a ) for any a [ 0 , 1 ] ; then, Theorems 1–11 hold.

4. Chain Mixing

Let ( G , s ) be a dynamical system on a metric space ( G , d ) . For x , y G , an ε -chain from x to y of length m is a finite sequence x 0 = x , x 1 , , x m = y such that d ( s ( x j ) , x j + 1 ) ε for j = 0 , 1 , , m 1 . The system ( G , s ) or the map s is said to be chain transitive if for any ε > 0 and any two points x , y G , there is an ε -chain from x to y. The system ( G , s ) or the map s is said to be ε -chain mixing if there is some N > 0 such that for any x , y G and any integer m N , there is an ε -chain from x to y such that its length is m. The system ( G , s ) or the map s is said to be chain mixing if it is ε -chain mixing for any ε > 0 .
Theorem 12. 
Assume that t and s are surjective. Then, t s is chain mixing if and only if s t is as well.
Proof. 
Assume that s t is chain mixing. Let ε > 0 . Since t is uniformly continuous, for the above ε > 0 , there is ε > 0 with ε < 1 2 ε such that if b 1 , b 2 H and | b 1 b 2 | < ε , then
| t ( b 1 ) t ( b 2 ) | < ε .
As s t is chain mixing, by the definition, there is an integer N > 0 such that for any integer n > N and any a , b H , one has an ε -chain of length n from a to b; that is, a 0 , a 1 , , a n H satisfy that a 0 = a , a n = b , and
| ( s t ) ( a j ) a j + 1 | < ε
for any
j { 0 , 1 , , n 1 } .
This implies that t ( a 0 ) , t ( a 1 ) , , t ( a n ) t ( H ) such that t ( a 0 ) = t ( a ) , t ( a n ) = t ( b ) , and
| t ( s t ) ( a j ) t ( a j + 1 ) | < ε
for any
j { 0 , 1 , , n 1 } .
Since t is surjective, by the definition and the above argument, t s is chain mixing. By a similar argument, one can deduce that if t s is chain mixing, then so is s t . □
Theorem 13. 
Assume that D ( a , b ) = ( t ( b ) , s ( a ) ) is a Cournot map, t and s are surjective. Then, the following two statements are true:
(1) 
If D is chain mixing, then both D 2 | Γ 1 and D 2 | Γ 2 are chain mixing.
(2) 
If D 2 | Γ 1 and D 2 | Γ 2 are chain mixing, then D is chain transitive.
Proof. 
Assume that D is chain mixing. By Corollary 12 in [28], D 2 is chain mixing. By D 2 = ( t s ) × ( s t ) , the chain mixing of D 2 and the definition, t s and s t is chain mixing. Suppose that t s is chain mixing. By the hypothesis and Theorem 3.8, s t is chain mixing. By the definition, one can easily verify that D 2 = ( t s ) × ( s t ) are chain mixing. Let ε > 0 . As s is uniformly continuous, for the above ε > 0 , there is ε 1 > 0 with ε 1 < ε such that if
| a 1 a 2 | < ε 1
and a 1 , a 2 G , then
| s ( a 1 ) s ( a 2 ) | < ε .
As t s is chain mixing, by the definition, for the above ε 1 > 0 , there is an integer N > 0 such that for any integer n > N and any a , b G , there is an ε 1 -chain of length n from a to b; that is, there are a 0 , a 1 , , a n G which satisfy that a 0 = a , a n = b , and
| ( t s ) ( a j ) a j + 1 | < ε
for any
j { 0 , 1 , , n 1 } .
By the hypothesis, s ( a 0 ) , s ( a 1 ) , , s ( a n ) s ( G ) such that s ( a 0 ) = s ( a ) , s ( a n ) = s ( b ) , and
| s ( t s ) ( a j ) s ( a j + 1 ) | < ε
for any
j { 0 , 1 , , n 1 } .
Then, we have
d ( D 2 ( ( a j , s ( a j ) ) ) , ( a j + 1 , s ( a j + 1 ) ) ) < ε
for every integer j { 0 , 1 , , n 1 } . As s is surjective, by the hypothesis and the above argument, D 2 | Γ 2 is chain mixing. Similarly, one can show that if s t is chain mixing, then so is D 2 | Γ 1 .
Now, assume that D 2 | Γ i is chain mixing for every i { 1 , 2 } , and let ε > 0 . By the definition, there is an integer N > 0 such that for any integer n > N and any a , b H (resp. a , b G ), there is an ε -chain of length n from ( t ( a ) , a ) to ( t ( b ) , b ) (resp. from ( a , s ( a ) ) to ( b , s ( b ) ) ); that is, there are ( t ( a 0 ) , a 0 ) , ( t ( a 1 ) , a 1 ) , , ( t ( a n ) , a n ) Γ 1 (resp. ( a 0 , s ( a 0 ) ) , ( a 1 , s ( a 1 ) ) , , ( a n , s ( a n ) ) Γ 2 ) which satisfy that ( t ( a 0 ) , a 0 ) = ( t ( a ) , a ) , ( t ( a n ) , a n ) = ( t ( b ) , b ) , | ( t s ) ( t ( a j ) ) t ( a j + 1 ) | < ε and | ( s t ) ( a j ) a j + 1 | < ε (resp. ( a 0 , s ( a 0 ) ) = ( a , s ( a ) ) , ( a n , s ( a n ) ) = ( b , s ( b ) ) , | ( t s ) ( a j ) a j + 1 | < ε and | ( s t ) ( s ( a j ) ) s ( a j + 1 ) | < ε ) for any j { 0 , 1 , , n 1 } . Then, an ε -chain
( a , a ) = ( a 0 , a 0 ) , ( t ( a 0 ) , s ( a 0 ) ) , ( a 1 , a 1 ) , ( t ( a 1 ) , s ( a 1 ) ) , ( a 2 , a 2 ) , , ( a n , a n ) = ( b , b )
of length 2 n + 1 from ( a , a ) to ( b , b ) 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 D 2 | Γ i chain transitive for every i { 1 , 2 } ?
(2) 
If D is chain mixing, is D 2 | Γ i chain mixing for every i { 1 , 2 } ?

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

  1. Puu, T.; Sushko, I. Oligopoly Dynamics: Models and Tools; Springer: New York, NY, USA, 2002. [Google Scholar]
  2. Li, T.Y.; Yorke, J.A. Period three implies chaos. Am. Math. Mon. 1975, 82, 985–992. [Google Scholar]
  3. Akin, E.; Kolyada, S. Li-Yorke sensitivity. Nonlinearity 2003, 16, 1421–1433. [Google Scholar]
  4. 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]
  5. Oprocha, P.; Wilczyński, P. Shift spaces and distributional chaos. Chaos Soliton. Fract. 2007, 31, 347–355. [Google Scholar]
  6. Smítal, J.; Stefánkovxax, M. Distributional chaos for triangular maps. Chaos Soliton. Fract. 2004, 21, 1125–1128. [Google Scholar]
  7. Pikula, R. On some notions of chaos in dimension zero. Colloq. Math. 2007, 107, 167–177. [Google Scholar]
  8. Wang, L.D.; Huang, G.F.; Huan, S.M. Distributional chaos in a sequence. Nonlinear Anal. 2007, 67, 2131–2136. [Google Scholar]
  9. Cánovas, J.S.; Marín, M.R. Chaos on MPE-sets of duopoly game. Chaos Soliton. Fract. 2004, 19, 179–183. [Google Scholar]
  10. Askar, S.S. On the dynamics of Cournot duopoly game with private firms: Investigations and analysis. Appl. Math. Comput. 2022, 432, 127352. [Google Scholar]
  11. 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]
  12. Dana, R.A.; Montrucchio, L. Dynamic complexity in duopoly games. J. Econ. Theory 1986, 44, 40–56. [Google Scholar] [CrossRef]
  13. Lu, T.X.; Zhu, P.Y. Further discussion on chaos in duopoly games. Chaos Soliton. Fract. 2013, 52, 45–48. [Google Scholar] [CrossRef]
  14. 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]
  15. 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]
  16. 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]
  17. Rand, D. Exotic phenomena in games and doupoly models. J. Math. Econ. 1978, 5, 173–184. [Google Scholar] [CrossRef]
  18. Li, R.S.; Wang, H.Q.; Zhao, Y. Kato’s chaos in duopoly games. Chaos Soliton. Fract. 2016, 84, 69–72. [Google Scholar] [CrossRef]
  19. 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]
  20. Zhao, Y.; Li, R.S. Chaos in Duopoly Games via Furstenberg Family Couple. Complexity 2019, 1, 5484629. [Google Scholar] [CrossRef]
  21. 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]
  22. 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]
  23. Mahajan, A.; Thakur, R.; Das, R. Sensitivity in hyperspatial and product systems via Furstenberg families. Topol. Appl. 2024, 349, 108907. [Google Scholar] [CrossRef]
  24. 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]
  25. 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]
  26. Moothathu, T.K.S. Stronger forms of sensitivity for dynamical systems. Nonlinearity 2007, 20, 2115–2126. [Google Scholar] [CrossRef]
  27. Aoki, N. Topological dynamics. In Topics in General Topology; North-Holland Mathematic Library: Amsterdam, The Netherlands, 1989; Volume 41. [Google Scholar]
  28. Richeson, D.; Wiseman, J. Chain recurrence rates and topological entropy. Topol. Appl. 2008, 156, 251–261. [Google Scholar] [CrossRef]
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.

Share and Cite

MDPI and ACS Style

Wang, H.; Lu, T.; Li, R.; Gao, P. Sensitivity, Shadowing Property and P-Chaos in Duopoly Games. Symmetry 2025, 17, 511. https://doi.org/10.3390/sym17040511

AMA Style

Wang H, Lu T, Li R, Gao P. Sensitivity, Shadowing Property and P-Chaos in Duopoly Games. Symmetry. 2025; 17(4):511. https://doi.org/10.3390/sym17040511

Chicago/Turabian Style

Wang, Hongqing, Tianxiu Lu, Risong Li, and Ping Gao. 2025. "Sensitivity, Shadowing Property and P-Chaos in Duopoly Games" Symmetry 17, no. 4: 511. https://doi.org/10.3390/sym17040511

APA Style

Wang, H., Lu, T., Li, R., & Gao, P. (2025). Sensitivity, Shadowing Property and P-Chaos in Duopoly Games. Symmetry, 17(4), 511. https://doi.org/10.3390/sym17040511

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop