Kato’s chaos in duopoly games
详细信息    查看全文
文摘
Let md5=0f42011ca0c8d19dfdbd853e054f1ee1" title="Click to view the MathML source">E,F⊂R be two given closed intervals, and let τ: EF and θ: FE   be continuous maps. In this paper, we consider Koto’s chaos, sensitivity and accessibility of a given system md5=b0ed57eecc1f224a57dc8b397d89fb51" title="Click to view the MathML source">Ψ(u,v)=(θ(v),τ(u)) on a given product space E × F where uE and vF  . In particular, it is proved that for any Cournot map md5=b0ed57eecc1f224a57dc8b397d89fb51" title="Click to view the MathML source">Ψ(u,v)=(θ(v),τ(u)) on the product space E × F, the following hold:
(1)

If Ψ   satisfies Kato’s definition of chaos then at least one of md5=471ff4e177c75225713b1073f73afc58" title="Click to view the MathML source">Ψ2|Q1 and md5=93f879fa1cb4c79827acb66d7a93807e" title="Click to view the MathML source">Ψ2|Q2 does, where md5=233dbeacecbbfcf9af8823fdcb3066e1" title="Click to view the MathML source">Q1={(θ(v),v):v∈F} and md5=b55176639a994ea4b62fbba5172ee3f5" title="Click to view the MathML source">Q2={(u,τ(u)):u∈E}.

(2)

Suppose that md5=471ff4e177c75225713b1073f73afc58" title="Click to view the MathML source">Ψ2|Q1 and md5=93f879fa1cb4c79827acb66d7a93807e" title="Click to view the MathML source">Ψ2|Q2 satisfy Kato’s definition of chaos, and that the maps θ and τ satisfy that for any ε > 0, if

md5=53466eecd59a4dbdce73edd8bb22de6b" title="Click to view the MathML source">∣n(τ∘θ)(v1)−n(τ∘θ)(v2)∣<ɛ
and
md5=1228bcd3d9880908fff4da0eae6e4368" title="Click to view the MathML source">∣m(θ∘τ)(u1)−m(θ∘τ)(u2)∣<ɛ
for some integers n, m > 0, then there is an integer l(n, m, ε) > 0 with
md5=d34cda2a124f7560319fa543a5a595f2" title="Click to view the MathML source">∣(τ∘θ)l(n,m,ɛ)(v1)−(τ∘θ)l(n,m,ɛ)(v2)∣<ɛ
and
md5=f036d16483503d6c6c134b58ac60245d" title="Click to view the MathML source">∣(θ∘τ)l(n,m,ɛ)(u1)−(θ∘τ)l(n,m,ɛ)(u2)∣<ɛ.
Then Ψ satisfies Kato’s definition of chaos.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700