In this paper, we introduce and study α-irresolute multifunctions, and some of their properties are studied. The properties of α-compactness and α-normality under upper α-irresolute multifunctions are topological properties. Also, we prove that the composition of two upper and lower α-irresolute multifunctions is α-irresolute. We apply the results of α-irresolute multifunctions to topological games. Upper and lower topological games are introduced. The set of places for player ONE in upper topological games may guarantee a gain is semi-closed. Finally, some optimal strategies for topological games are defined and studied.
Citation: Sewalem Ghanem, Abdelfattah A. El Atik. On irresolute multifunctions and related topological games[J]. AIMS Mathematics, 2022, 7(10): 18662-18674. doi: 10.3934/math.20221026
[1] | M. N. Abu_Shugair, A. A. Abdallah, Malek Alzoubi, S. E. Abbas, Ismail Ibedou . Picture fuzzy multifunctions and modal topological structures. AIMS Mathematics, 2025, 10(3): 7430-7448. doi: 10.3934/math.2025341 |
[2] | M. N. Abu_Shugair, A. A. Abdallah, S. E. Abbas, Ismail Ibedou . Double fuzzy α-ð-continuous multifunctions. AIMS Mathematics, 2024, 9(6): 16623-16642. doi: 10.3934/math.2024806 |
[3] | Samer Al Ghour . On some types of functions and a form of compactness via ωs-open sets. AIMS Mathematics, 2022, 7(2): 2220-2236. doi: 10.3934/math.2022126 |
[4] | Ibtesam Alshammari, Islam M. Taha . On fuzzy soft β-continuity and β-irresoluteness: some new results. AIMS Mathematics, 2024, 9(5): 11304-11319. doi: 10.3934/math.2024554 |
[5] | Muneerah Al Nuwairan, Ahmed Gamal Ibrahim . Nonlocal impulsive differential equations and inclusions involving Atangana-Baleanu fractional derivative in infinite dimensional spaces. AIMS Mathematics, 2023, 8(5): 11752-11780. doi: 10.3934/math.2023595 |
[6] | Tao Chen, Hui Zhang, Jun Li . Egoroff's theorems for random sets on non-additive measure spaces. AIMS Mathematics, 2021, 6(5): 4803-4810. doi: 10.3934/math.2021282 |
[7] | Samirah Alzahrani, A. A. Nasef, N. Youns, A. I. EL-Maghrabi, M. S. Badr . Soft topological approaches via soft γ-open sets. AIMS Mathematics, 2022, 7(7): 12144-12153. doi: 10.3934/math.2022675 |
[8] | Fahad Alsharari, Ahmed O. M. Abubaker, Islam M. Taha . On r-fuzzy soft γ-open sets and fuzzy soft γ-continuous functions with some applications. AIMS Mathematics, 2025, 10(3): 5285-5306. doi: 10.3934/math.2025244 |
[9] | Aleksejus Mihalkovich, Jokubas Zitkevicius, Eligijus Sakalauskas . The security analysis of the key exchange protocol based on the matrix power function defined over a family of non-commuting groups. AIMS Mathematics, 2024, 9(10): 26961-26982. doi: 10.3934/math.20241312 |
[10] | Hanadi Zahed, Zhenhua Ma, Jamshaid Ahmad . On fixed point results in F-metric spaces with applications. AIMS Mathematics, 2023, 8(7): 16887-16905. doi: 10.3934/math.2023863 |
In this paper, we introduce and study α-irresolute multifunctions, and some of their properties are studied. The properties of α-compactness and α-normality under upper α-irresolute multifunctions are topological properties. Also, we prove that the composition of two upper and lower α-irresolute multifunctions is α-irresolute. We apply the results of α-irresolute multifunctions to topological games. Upper and lower topological games are introduced. The set of places for player ONE in upper topological games may guarantee a gain is semi-closed. Finally, some optimal strategies for topological games are defined and studied.
Topological games (TGs, for short) with perfect information were introduced and studied by Berge [3]. Many authors have them to solve some topological problems (e.g., [35,36]). For further details, see [3,4,23,27]. TGs have been extended to topological spaces [9,10,12,13] and their applications. The continuity on multifunctions is studied in [14]. Pears [32] has defined and studied TGs for continuous multifunctions. Recently, topological spaces have been used in applications to study graphs in [15,16,17,18,22,24] which are used in physics [8,11,19,20] and smart cities [2].
Topologically, X and Y are topological spaces (TSs, for short). A multifunction of X into Y is defined as a function ϝ:X→2Y, where 2Y is the power set of Y. Additionally, A∈SO(X) [25] if ∃ an open set U of X s.t. U⊆A⊆Cl(U), where Cl(U) is the closure of U w.r. to X. Ewert and Lipski [21] introduced the concept of irresolute multifunctions. Papa and Noiri [33] further studied irresolute multifunctions. For A⊆X, the interior of A will be denoted by Int(A). Multifunctionally, the upper and lower inverses of ϝ:X→Y are ϝ+(B)= {x∈X:ϝ(x)⊆B} and ϝ−(B)= {x∈X:ϝ(x)∩B≠ϕ}, respectively.
Throughout the present paper, some new properties of upper (lower) α-irresolute multifunctions due to Neubrunn [30] and Noiri and Nasef [31] are modified and studied. Also, we apply the results to introduce and study new types of TGs for irresolute multifunctions, such as locally finite games, upper and lower TGs and optimal strategies for TGs.
Here, the class of semi-open sets of X is named SO(X), and SO(X,x) is all semi-open sets of X containing x∈X. Its complement is called semi-closed [5] and named SC(X). A⊆X is α-open [29] if A⊆Int(Cl(Int(A))). The class of all α-open sets is denoted by αO(X). Its complement is α-closed and is denoted by αC(X).
Definition 1.1. [21]A multifunction ϝ:X→Y is
(a) upper irresolute (resp. lower irresolute) at x∈X if ∀ V∈SO(Y) s.t. ϝ(x)⊆V (resp. ϝ(x)∩V≠ϕ), ∃ U∈SO(X,x) s.t. ϝ(u)⊆V (resp. ϝ(u)∩V≠ϕ), ∀ u∈U.
(b) upper irresolute (resp. lower irresolute) if it is upper irresolute (resp. lower irresolute) at all x∈X.
Definition 1.2. [6] A subset A of (X,τ) is semi-comp (s-comp, for short) if every cover of A by SO(X,τ) has a finite subcover.
Lemma 1.1. [1] For a subset A of X, αCl(A)= A∪τ−Cl(τ−Int(τ−Cl(A))).
Numerous characterizations of upper (resp. lower) α-irresolute functions have been published in the literature [4,30,31], and we add a few more.
Definition 2.1. A multifunction F:(X,τ)→(Y,σ) is called α-irresolute at x∈X if ∀ pairs Wi∈αO(Y,σ), i=1,2, s.t. F(x)⊆W1 and F(x)∩W2≠ϕ, ∃ H∈α(X,x) with F(H)⊆W1 s.t. F(h)∩W2≠ϕ ∀ h∈H.
Thus, F:(X,τ)→(Y,σ) is α-irresolute if it exhibits the aforementioned quality at each x∈X.
Theorem 2.1. The following are equivalent:
(i) F is α-irresolute at x∈X;
(ii) for any W1,W2∈αO(Y,σ) s.t. F(x)⊆W1 and F(x)∩W2≠ϕ, we get x∈τ−Int(τ−Cl(τ−Int[F+(W1)∩F−(W2)]));
(iii) ∀ W1,W2∈αO(Y,σ) with F(x)⊆W1, F(x)∩W2≠ϕ and for any open set U⊆X having x, ∃ a nonempty open set G of X with G⊆U, F(G)⊂W1 and F(g)∩W2≠ϕ ∀ g∈G.
Proof. (i) ⇒ (ii): Let Wi∈αO(Y,σ), i=1,2, s.t F(x)⊆W1 and F(x)∩W2≠ϕ. By assumption, ∃ H∈αO(Y,x) s.t. F(H)⊆W1 and F(h)∩W2≠ϕ ∀ h∈H. So, x∈H⊆F+(W1) and, x∈H⊆F−(W2)≠ϕ. Hence, x∈H⊆F+(W1)∩F−(W2). Since H is α-open in X, x∈H⊆τ−Int(τ−Cl(τ−Int(H))) ⊆ τ−Int(τ−Cl(τ−Int[F+(W1)∩F−(W2)])).
(ii) ⇒ (iii): Let Wi∈αO(Y,σ), F(x)⊆W1, and F(x)∩W2≠ϕ. However, (ii) gives x∈τ−Int(τ−Cl(τ−Int[F+(W1)∩F−(W2)])). Also, let U≠ϕ containing x. Then, U∩[τ−Int[F+(W1)∩F−(W2)]] ⊆ U∩[τ−IntF+(W1) ∩ τ−IntF−(W2)]=G, which is open, and G⊆τ−IntF+(W1). Also, G⊆τ−IntF−(W2) ⊆ F−(W2), so F(G) ⊆ W1 and F(g)∩W2≠ϕ ∀ g∈G.
(iii) ⇒ (i): This follows immediately from the observation τ(x) ⊆ α(X,x).
Theorem 2.2. The following are equivalent:
(i) F is α-irresolute;
(ii) for any W1,W2∈αO(Y,σ), F+(W1)∩F−(W2)∈αO(X,τ);
(iii) ∀ α-closed sets K1,K2⊆Y, F−(K1)∪F+(K2) is α-closed;
(iv) ∀ B1,B2⊆Y, τ−Cl(τ−Int(τ−Cl[F−(B1)∪B+(B2)])) ⊆ F−(αCl(B1))∪F+(αCl(B2));
(v) αCl[F−(B1)∪F+(B2)] ⊆ F−(αCl(B1)∪F+(αCl(B2) for any B1,B2⊆Y;
(vi) F−(αInt(B1))∩F+(αInt(B2)) ⊆ αInt[F−(B1)∩F+(B2)] for any B1,B2⊆Y;
(vii) for x∈X and ∀ α-nbd N of F(x), then for every W∈αO(Y,σ) s.t. W∩F(x)≠ϕ, F+(N)∩F−(W) is an α-nbd of x;
(viii) Let for any x∈X and ∀ α-nbd N of F(x). Then, for every W∈αO(Y,σ) s.t. W∩F(x)≠ϕ, ∃ α-nbd U of x s.t. F(U)⊆N and F(u)∩W≠ϕ ∀ u∈U.
Proof. (i) ⇒ (ii): Let x∈F+(W1)∩F−(W2) for any W1,W2∈αO(Y,σ). Then, F(x)∈W1 and F(x)∩W2≠ϕ. Since F is α-irresolute, by Theorem 2.1, x∈τ−Int(τ−Cl(τ−Int[F+(W1) ∩ F−(W2)])).
(ii) ⇒ (iii): Immediately from that, if V⊆Y, then F−(Y−V)= X−F+(V), and F+(Y−V)= X−F−(V).
(iii) ⇒ (iv): Let B1,B2⊆Y. Then, αCl(Bi)∈αC(Y), ∀ i=1,2, where αC(Y) will denote to the class of α closed sets of Y. By (iii), F−(αCl(B1)) ∪ F+(αCl(B2))∈αC(X,τ), i.e., τ−Cl(τ−Int(τ−Cl[F−(αCl(B1)) ∪ F+(αCl(B2))])) ⊆ F−(αCl(B1)) ∪ F+(αCl(B2)), since F+(B2) ⊆ F+(αCl(B2)) and F−(B1) ⊆ F−(αCl(B1)). Consequently, τ−Cl(τ−Int(τ−Cl[F−(B1) ∪ F+(B2)])) ⊆ τ−Cl(τ−Int(τ−Cl[F−(αCl(B1)) ∪ F+(αCl(B2))])) ⊆ F−(αCl(B1)) ∪ F+(αCl(B2)).
(iv) ⇒ (v): Directly by Lemma 1.1.
(v) ⇒ (vi): X−αInt[F−(B1) ∩ F+(B2)] ⊆ αCl[X−(F−((B1) ∩ F+(B2)]= αCl[(X−F−(B1))∪(X−F+(B2))]= αCl[F+(Y−B1)∪F−(Y−B2) ⊆F+(αCl(Y−B1))∪F−(αCl(Y−B2))= F+(Y−αInt(B1)) ∪F−(Y−αInt(B2))= (X−F−(αInt(B1)) ∪(X−F+(αInt(B2))= X−[F−(αInt(B1)) ∩F+(αInt(B2))]. Therefore, αInt[F−(B1)∩F+(B2)] ⊇[F−(αInt(B1) ∩F+(αInt(B2)].
(vi) ⇒ (vii): Let x∈X, N be an α-nbd of F(x), and W∈αO(Y) with F(x)∩W≠ϕ. Then, ∃ U1,U2∈αO(Y) s.t. U1⊆N, U2⊆W, F(x)⊆U1 and F(x)∩U2≠ϕ. Thus, x∈F+(U1)∩F−(U2). By assumption, x∈F+(U1)∩F−(U2)= F+(αInt(U1))∩F−(αInt(U2)) ⊆ αInt[F+(U1)∩F−(U2)] ⊆ αInt[F+(N)∩F−(W)] ⊆ F+(N)∩F−(W). It follows that F+(N)∩F−(W) is an α-nbd of x.
(vii) ⇒ (viii): Let x∈X, N be an α-nbd of F(x) and W∈αO(Y,σ) with F(x)∩W≠ϕ. Then, U=F+(N)∩F−(W) is an α-nbd of x, F(U)⊆N, and F(u)∩W≠ϕ ∀ u∈U.
(viii) ⇒ (i): Clear by given hypothesis.
Noiri and Nasef [31] provided the following definitions of upper and lower α-irresoluteness.
Theorem 2.3. The following are equivalent:
(1) F is upper (resp. lower) α-irresolute;
(2) F+(W) (resp. F−(W)) ∈αO(X,τ), ∀ W∈αO(Y,σ);
(3) F−(K) (resp. F+(K)) ∈αC(X,τ) ∀ K ∈αC(Y,σ);
(4) sInt(Cl(F−(B))) ⊆ F−(αCl(B)) (resp. sInt(Cl(F+(B))) ⊆ F+(αCl(B)) ∀ B⊆Y;
(5) αCl(F−(B)) ⊆ F−(αCl(B)) (resp. αCl(F+(B)) ⊆ F+(αCl(B)) ∀ B⊆Y.
Theorem 2.4. The following are equivalent:
(1) F is lower α-irresolute;
(2) F(τ−Cl(τ−Int(τ−Cl(H)))) ⊆ F(H) ∀ H∈αO(X,τ);
(3) F(αCl(H))⊆F(H) ∀ H∈αO(X,τ).
Proof. (1)⇔(2): By comparison with Theorem 2.3 and W=F(H), the proof is followed.
(2) ⇒ (3): Follows using Lemma 1.1.
(3) ⇒ (1): Let x∈X and W∈αO(Y) with F(x)∩W≠ϕ. Then, x∈F−(W). By (iii), F(αCl(F+(Y−W))) ⊆ F(F+(Y−W)) ⊆ Y−W. So, αCl(F+(Y−W)) ⊆ F+(Y−W). Hence, F+(Y−W)∈αC(X,τ), and then F−(W)∈αO(X). Set H=F−(W), H∈α(X,x), and F(h)∩W≠ϕ ∀ h∈H. Therefore, F is lower α-irresolute.
Lemma 2.1. [33]For all V∈O(Y), (αClF)−(V)= F−(V).
Proof. Let V∈O(Y) and x∈(αClF)−(V). Then, (αClF)(x)∩V= αCl(F(x))∩V≠ϕ, and so F(x)∩V= ≠ϕ. By openness of V, x∈F−(V), and so (αClF)−(V) ⊆ F−(V). On the other side, let x∈F−(V). Then, ϕ≠F(x)∩V ⊆ (αClF)(x)∩V, and so x∈(αClF)−(V). Thus, we get F−(V) ⊆ (αClF)−(V). Therefore, (αClF)−(V)= F−(V).
Theorem 2.5. F:X→Y is lower α-irresolute iff αClF:X→Y is so.
Proof. "⇒", let F be lower α-irresolute, V∈O(Y) s.t. (αClF)(x)∩V≠ϕ, for x∈X. By Lemma 2.1, x∈(αClF)−(V)= F−(V), and so F(x)∩V≠ϕ. By assumption of F, ∃ U∈α(X,x) s.t. U⊆F−(V)= (αClF)−(V). Hence, αClF is lower α-irresolute. "⇐", let αClF be lower α-irresolute, x∈X, and V∈O(Y) with F(x)∩V≠ϕ. By Lemma 2.1, x∈F−(V)= (αClF)−(V). By assumption, ∃ U∈α(X,x) s.t. U⊆(αClF)−(V)= F−(V).
The following lemma was shown by Mashhour [26] and Rielly and Vamanamurthly [34]. A subset A is γ-open [7] if A⊆Int(Cl(A))∪Cl(Int(A)). The class of all γ-open sets is denoted by γO(X). It is noted that SO(X)∪PO(X) ⊆ γO(X).
Lemma 3.1. Let A and B be subsets of a TS (X,τ). Then
(i) If A∈γO(X) and B∈αO(X), then A∩B∈αO(A).
(ii) If A⊆B⊆X, A∈αO(B), and B∈αO(X), then A∈αO(X).
Theorem 3.1. Let F:(X,τ)→(Y,σ) be upper (resp. lower) α-irresolute, and X0∈γO(X,τ). Then, the restriction F∣X0:(X0,τ∣X0)→(Y,σ) is upper (resp. lower) α-irresolute.
Proof. Let x∈X0 and V∈αO(Y) s.t. (F∣X0)(x)⊆V. By upper α-irresoluteness of F, (F∣X0)(x)= F(x), and ∃ U∈αO(X) having x s.t. F(U)⊆V. Take U0= U∩X0, and then by Lemma 3.1, we get x∈U0∈αO(X0) and (F∣X0)(U0)⊆V. Hence, F∣X0 is upper α-irresolute. Lower α-irresoluteness is analogous.
Theorem 3.2. F:(X,τ)→(Y,σ) is upper (resp. lower) α-irresolute if ∀ x∈X, ∃ X0∈αO(X) having x s.t. the restriction F∣X0:(X0,τ∣X0)→(Y,σ) is upper (resp. lower) α-irresolute.
Proof. Let x∈X and V∈αO(Y) s.t. F(x)⊆V. ∃ X0∈α(X,x) s.t. F∣X0 is upper α-irresolute. Therefore, ∃ U0∈αO(X0) having x s.t. (F∣X0)(U0)⊆V. By Lemma 1, U0∈αO(X) and F(u)= (F∣X0)(u) ∀ u∈U0. Hence, F is upper α-irresolute. Lower α-irresoluteness is analogous.
Corollary 3.1. Let X= ⋃λ∈∇ Uλ, Uλ∈αO(X). F:(X,τ)→(Y,σ) is upper (resp. lower) α-irresolute iff the restriction F∣Uλ:(Uλ,τ∣Uλ)→(Y,σ) is upper (resp. lower) α-irresolute for λ∈∇.
Proof. Immediate consequence from Theorems 3.1 and 3.2.
A⊆X is α-compact (α-comp, for short) if A ⊆ ∞⋃i=1Ui, Ui∈αO(X), then A=n⋃i=1Ui, where n is finite. In other words, X is α-comp [28] iff X is α-comp of itself. Moreover, A is α-comp iff A is comp w.r. to τα.
Theorem 3.3. Let F be upper α-irresolute, and F(x) is α-comp w.r. to ταY ∀ x∈X. If A is an α-comp w.r. to X, then F(A) is an α-comp w.r. to Y.
Proof. Let F(A)= ⋃λ∈∇ {Vλ:Vλ∈αO(Y)}. ∀ x∈A, ∃ a finite ∇(x)⊂∇ s.t. F(x) ⊆ ⋃λ∈∇(x) {Vλ:Vλ∈αO(Y)}. Set V(x)= ⋃λ∈∇(x) {Vλ:Vλ∈αO(Y)}. Then, F(x)⊆V(x)∈αO(Y), and ∃ U(x)∈α(X,x) s.t. F(U(x))⊆V(x). Since {U(x):x∈A} is an α-open cover of A, ∃ a finite number of A, say, x1,x2,⋯,xn s.t. A⊆⋃{U(xi): i=1,2,⋯,n}. Therefore, we get F(A) ⊆ F(n⋃i=1U(xi)) ⊆ n⋃i=1V(xi) ⊆ n⋃i=1⋃λ∈∇(x)Vλ. Hence, F(A) is α-comp w.r. to Y.
Corollary 3.2. Let F be α-irresolute, and F(x) is α-comp w.r. to Y, ∀ x∈X. If X is an α-comp, then Y is so.
Recall that X is α-normal if for A,B∈C(X) s.t. A∩B=ϕ, ∃ U,V∈αO(X) s.t. U∩V=ϕ, and A⊆U and B⊆V.
Theorem 3.4. Let Y be α-normal, and Fi:Xi→Y is upper α-irresolute s.t. Fi is closed, ∀ i=1,2. Then, {(x1,x2)∈X1×X2:F1(x1)∩F2(x2)≠ϕ}∈αC(X1×X2).
Proof. Let A= {(x1,x2)∈X1×X2:F1(x1)∩F2(x2)≠ϕ}, and (x1,x2)∉A. Then, F1(x1)∩F2(x2)= ϕ. Since Y is α-normal, and Fi is closed for i=1,2, ∃ disjoint V1,V2∈αO(X) s.t. Fi(xi)⊆Vi for i=1,2. By assumption, F+i(Vi)∈αO(Xi,xi) for i=1,2. Set U= F+1(V1)×F+2(V2). Then, U∈αO(X1×X2), and (x1,x2)∈U⊆(X1×X2)−A. Hence, (X1×X2)−A∈αO(X1×X2).
For a multifunction F:X→Y, G(F) is G(F)= {(x,y)∈X×Y:x∈X and y∈F(x)}.
Theorem 3.5. Let Y be a Hausdorff space, and F:X→Y is upper α-irresolute s.t. F(x) is comp, ∀ x∈X. Then, G(F)∈αC(X×Y).
Proof. Let (x,y)∈(X×Y)−G(F). Then, y∈Y−F(x). ∀ z∈F(x), ∃ disjoint V(z),W(z)∈O(Y) s.t. z∈V(z) and y∈W(z). F(x)= ⋃z∈F(x) V(z), and ∃ a finite number in F(x), say, z1,z2,⋯,zn s.t. F(x) ⊆ ⋃{V(zi):1≤i≤n} and W= ⋂{W(zi):1≤i≤n}. By the upper α-irresoluteness of F, and F(x)⊆V, ∃ U∈α(X,x) s.t. F(U)⊆V. Therefore, F(U)∩W= ϕ, and so (U×W)∩G(F)= ϕ. Since U×W∈αO(X×Y), and (x,y)∈U×W ⊆ (X×Y)−G(F), (X×Y)−G(F)∈αO(X×Y).
Theorem 3.6. If F:X→Y and G:Y→Z are lower (resp. upper) α-irresolute, then G∘F:X→Z is so.
Proof. Let V∈αO(Z). Since (G∘F)−(V)= F−(G−)(V) and by lower α-irresoluteness of F and G, we get (G∘F)−(V)∈αO(X). Thus, G∘F is lower α-irresolute. Similarly, the upper is satisfied.
Due to these applications, consider each Xi to be a topological structure, ∀ i=1,2,⋯,n, and topologically X= ⨁i∈IXi.
Definition 4.1. A game G on X for the players I1,I2,⋯,In consists of the following
(i) {N+,N−} from N is a partition of players.
(ii) {X1,X2,⋯,Xn} from X is a partition of sets.
(iii) An irresolute multifunction ϝ of X onto itself s.t. ϝ(Xi)∩Xi= ϕ for i=1,⋯,n.
(iv) n-bounded real valued functions L1,L2,L3,⋯,Ln on X.
The procedures of G are as follows:
The locations are represented by the components of X, and play begins at any point in X. x∈Xi denotes the location of player Ii at x. If x0 is the starting location, the following sequence occurs: Player Ii selects x1∈ϝ(x0) for x∈Xi. If x1∈Xj, player Ij selects x2∈ϝ(x1), and so on. If ϝ(x)= ϕ, the play ends at x. In other terms, a play is a sequence consisting of the elements <x0,ϝ(x0),x1,ϝ(x1),⋯> s.t. x0∈ϝ(x0), x1∈ϝ(x1) and so on.
Definition 4.2. For a sequence of a play <x0,ϝ(x0),x1,ϝ(x1), ⋯, xk,ϝ(xk)> with k+1 points, the length of it is k. Here, the kth_ element satisfies ϝ(xk)= ϕ.
Definition 4.3. G is locally finite (LF, for short) if each play length is finite. If S is the set of locations in a play, the payoff to Ii is either sup{Li(x):x∈S} or inf{Li(x):x∈S}, depending on whether Ii∈N+ or Ii∈N−. Each player's objective is to maximize their payoff.
Definition 4.4. If player Ii can make sure that Payoff(Ii)≥ ξ, no matter what other players do, ∀ plays beginning with x, no matter what other players do. If Payoff(Ii)> ξ, he is rigorously guaranteeing ξ from x.
Lemma 4.1. [1] If G∈O(X) and A⊆X, then G∩Cl(A)⊆Cl(G∩A).
Proposition 4.1. If X= ⨁i∈IXi and A∈SO(X), then A∩Xi∈SO(Xi) ∀ i∈I. The converse holds only if A∈O(X).
Proof. Let A∈SO(X). Then, A∩Xi⊆Cl(Int(A))∩Xi. Since Xi∈O(X), ∀ i, by Lemma 4, A∩Xi⊂Cl(Int(A))∩Xi= Cl(Int(A))∩Xi. Then, A∩Xi⊂(Cl(Int(A))∩Xi)∩Xi= (ClXi(Int(A))∩Xi)∩Xi. Since Xi is a subspace of X, ∀ i∈I, then (Int(A)∩Xi)∩Xi∈O(Xi). Therefore, A∩Xi ⊆ ClXi(IntXi(Int(A∩Xi)))∩Xi= ClXi(IntXi(Int(A∩Xi))) ⊆ ClXi(IntXi(A∩Xi)). So, A∩Xi∈SO(Xi), ∀ i∈I. On the other hand, let A∈O(X), and A∈SO(Xi). Then, A∩Xi ⊆ ClXiIntXi(A∩Xi) ⊆ ClXi(A∩Xi)= Xi∩Cl(A∩Xi) ⊆ Cl(A) ∩Xi implies A⊆Cl(A). By openness of A, A⊆Cl(IntA), and A∈SO(X).
Definition 4.5. For a TS X, L:X→R is upper and lower s-continuous if ∀ r∈R, {L(x)<r, ∀ x∈X} and {L(x)>r, ∀ x∈X}, ∃ U∈SO(X) s.t. {L(x′)<r, ∀ x′∈U} and {L(x′)>r, ∀ x′∈U}, respectively.
Definition 4.6. G is called
(i) upper topological (UT, for short) for Ii if Li is upper s-continuous.
(ii) lower topological (LT, for short) for Ii if Li is lower s-continuous.
Theorem 4.1. If G is lower for I1∈N+, then all locations that satisfy I1 is strictly guarantee a gain ξ is in SO(X).
Proof. (By transfinite induction). Consider the set of starting locations Aξ s.t I1 is a rigorous guarantee of ξ. Then, (X1∩ϝ−(Aξ)) ∪ (n⋃j=1(Xj∩ϝ+(Aξ))) ⊆ Aξ. Note that ϝ+(Aξ)= {x∈X:ϝ(x) ⊆ Aξ}, and ϝ−(Aξ)= {x∈X:ϝ(x)∩Aξ ≠ϕ}. Construct A(Δ)∈SO(X) s.t. A(Δ)⊆Aξ, ∀ ordinal Δ as follows: Let A(0)= {x∈X:L1(x)>ξ}. By assumption, we get that L1 is lower s-continuous. Thus, A(0)∈SO(X), and A(0) ⊆ Aξ. Define A(β)∈SO(X) ⊆ Aξ, ∀ ∇<Δ. Let Δ be a limit and A(Δ)= ⋃∇<ΔA(∇). Then, A(Δ)∈SO(X), and A(Δ) ⊆ Aξ. If Δ is not a limit ordinal, then Δ= Δ′+1. Let A(Δ)= A(Δ′) ∪ (X1∩ϝ−(A(Δ′))) ∪ n⋃n=2(Xj ∩ ϝ+(A(Δ′))) by hypothesis, A(Δ′)∈SO(X) and by Proposition 1, X1∩ϝ−(A(Δ′)) and Xj∩ϝ+(A(Δ′))∈SO(X), ∀ j=2,3,⋯,n. Since X= ⨁i∈IXi and ϝ is irresolute, then A(Δ)∈SO(X) and A(Δ) ⊆ Aξ, for A(Δ′) ⊆ Aξ and (X1∩ϝ−(A(Δ′))) ∪ n⋃j=2(Xj∩ ϝ+(A(Δ′))) ⊆ (X1∩ϝ−(Aξ)) ∪ n⋃j=2(Xj ∩ ϝ+(Aξ)) ⊆ Aξ. Hence, ∀ ordinal Δ, A(Δ)∈SO(X), and A(Δ) ⊆ Aξ. Since the sequence {A(Δ)} is increasing and cannot be constant, A(Δ0)= A(Δ0+1)= ⋯, for some Δ0. Let A′= X−A(Δ0). If x∈A′∩X1, then ϝ(x) ⊆ A′, while if x∈A′∩Xj, where j≠1, then ϝ(x) ∩A′≠ϕ. Therefore, if a play begins from a point in A′, for instance, I1 does, players I2, I3, ⋯, In can ascertain that a location in A(Δ0) is never achieved. A(Δ0) ⊇ A(0)= {x:L1(x)>ξ}. Thus, if x∈A′, then x∉A(Δ0), and so x∉Aξ, and so Aξ⊆ A(Δ0). A(Δ0) ⊆ Aξ by construction, and so Aξ= A(Δ0). Hence, Aξ∈SO(X).
Remark 4.1. Although the complement of SO(X) is SC(X), and ϝ is irresolute, ϝ+(X)∈SO(X). Then, X0= X−ϝ+(X)∈SC(X) and the complement of criteria in Theorem 4.1 does not hold that the set of places from which I1 may ensure a benefit for ξ is semi-closed. Theorem 4.2 specifies additional requirements for the semi-closed nature of this set.
Theorem 4.2. Let G be UT for I1∈N+, LF, and X0= {x:ϝ(x)= ϕ}∈SO(X). Then, the set of places s.t. I1 may guarantee a gain to the holder is in SO(X).
Proof. (By transfinite induction). Define X(Δ)∈SO(X) ∀ ordinal Δ. Let X(0)= X0= {x:ϝ(x)= ϕ}. Then, X(0)∈SO(X). Construct X(∇)∈SO(X) ∀ ordinals ∇<Δ. If Δ is limit, and X(Δ)= (⋃∇<ΔX(∇))∈SO(X). If Δ has a precursor Δ′ i.e. Δ= Δ′+1, take X(Δ)= X(Δ′) ∪ ϝ+(X(Δ′)). By ϝ irresoluteness, X(Δ)∈SO(X). Thus, ∀ ordinal Δ, by transfinite induction, X(Δ)∈SO(X). If ∇<Δ, X(∇)<X(Δ). Hξ is defined as the collection of places from which I1 may guarantee ξ. Then, (X1 ∩ ϝ−(Hξ)) ∪ n⋃j=2(Xj ∩ ϝ+(Hξ)) ⊆ Hξ. Define a set H(Δ), ∀ Δ s.t.
(i) H(Δ)⊆Hξ;
(ii) if ∇<Δ, H(∇)⊆H(Δ);
(iii) if ∇<Δ, H(Δ)∩X(∇)= H(∇) ∩ X(∇); and
(iv) H(Δ)∩X(Δ)∈SC(X) in X(Δ).
The conditions (i)-(iv) can be satisfied in three claims.
Claim I. Let H(0)= {x:L1(x)≥ξ}. Since L1 is upper s-continuous, H(0)∈SC(X) in X. Also, H(0)⊆Hξ, and so (H(0)∩X(0))∈SC(X) in X(0). Consider H(∇) that satisfies conditions (i)-(iv) is constructed, ∀ ∇<Δ.
Claim II. If Δ is a limit ordinal, take H(Δ)= ⋃∇<ΔH(∇). Then, H(Δ)⊆Hξ, ∀ ∇<Δ. Also, if ∇<Δ, then H(∇)⊆H(Δ), and if ∇′<Δ, H(Δ) ∩ X(∇′)= (⋃∇<ΔH(∇)) ∩ X(∇′)= ⋃∇<Δ(H(∇)) ∩ X(∇′). If ∇<Δ′, then H(∇) ∩ X(∇′) ⊆ H(∇′) ∩ X(β′); and if ∇′≤∇<Δ, H(∇)∩X(∇′)= H(∇′) ∩ X(∇′). Hence, H(∇) ∩ X(∇′)= H(∇′) ∩ X(∇′), and (iii) is satisfied. If x∈X(Δ), and x∉H(Δ), then x∈X(∇) for some ∇<Δ, and x∉H(∇). Now, H(∇) ∩ X(∇)∈SC(X) in X(∇), and so ∃ a semi-open nbd A of x in X(∇) s.t. A∩H(∇)= ϕ. Now, since X(∇), and A∈SO(X) and A⊆X(∇)⊆X(Δ), A∈SO(X) in X(Δ). By (iii), X(∇) ∩ H(Δ)= X(∇) ∩ H(∇), and so A is a semi-open nbd of x in X(Δ) s.t. A∩H(Δ)= ϕ. Thus, (iv) is satisfied.
Claim III. If Δ has a predecessor Δ′. This means that Δ= Δ′+1. Take H(Δ)= H(Δ′) ∪ (X1∩ϝ−(H(Δ′))) ∪ n⋃j=2(Xj∩ϝ+(H(Δ′))). Since H(Δ′) ⊆ Hξ, and X1∩ϝ−(H(Δ′)) ∪ n⋃j=2(Xj ∩ ϝ+(H(Δ′))) ⊆ (X1 ∩ ϝ−(Hξ)) ∪ n⋃j=2(Xj∩ϝ+(Hξ)) ⊆ Hξ, (i) is satisfied, and (ii) is clear. Suppose ∇′<Δ. If x∈X(∇′), and ϝ(x)≠ϕ, then ϝ(x) ⊆ X(∇) for some ∇<∇′. Thus, if x∈X(∇′) ∩ (X1∩ϝ−(H(Δ′))), ϝ(x) ∩ {X(∇) ∩ H(Δ′)} ≠ ϕ for ∇<∇′ ≤ Δ′. Thus, x∈X(∇′) ∩ (X1 ∩ ϝ−(H(∇))) ⊂ X(∇′) ∩ H(∇+1) ⊂ X(∇′) ∩ H(∇′). In the same manner, if j≠1, X(∇′) ∩ (Xj∩ϝ+(H(Δ′))) ⊆ X(∇′) ∩ H(∇′). Also, X(∇′) ∩ H(Δ′)= X(∇′) ∩ H(∇′). Thus, X(∇′) ∩ X(Δ)= X(∇′) ∩ [H(Δ′) ∪ (X1 ∪ ϝ−(H(Δ′))) ∪ n⋃j=2Xj ∩ ϝ+(H(Δ′))]= X(∇′) ∩ H(∇′), and so (iii) is satisfied. Finally, for (iv), suppose that x∈X(Δ), and x∉H(Δ). If x∈X(Δ′), then x∉H(Δ′), and since (H(Δ′)∩X(Δ′))∈SC(X) in X(Δ′), ∃ a semi-open nbd A of x in X(Δ′) s.t. A∩H(Δ′)= ϕ. Since X(Δ′)∈SO(X), and A⊆X(Δ′)⊆X(Δ), A is a semi-open nbd of x in X(Δ); and since X(Δ′) ∩ H(Δ)= X(Δ′)H(Δ′), by (iii), A∩H(Δ)= ϕ. If x∈(X(Δ)−X(Δ′))∩X1, then ϝ(x)⊆(X(Δ′)−H(Δ′)). (X(Δ′)−H(Δ′))∈SO(X) in X(Δ′) and so is semi-open in X. X1∩ϝ+(X(Δ′)−H(Δ′)) is a semi-open nbd of x s.t. [X1∩ϝ+(X(Δ′)−H(Δ′))] ∩ H(Δ)=ϕ. If x∈(X(Δ)−X(Δ′))∩Xj, then ϝ(x)∩(X(Δ)−H(Δ′))≠ϕ, and Xj∩ϝ−(X(Δ′)−H(Δ′)) is a semi-open nbd of x s.t. [Xj∩ϝ−(X(Δ′)−H(Δ′))] ∩ H(Δ)= ϕ. In either case, if x∈X(Δ) and x∉H(Δ), ∃ a semi-open nbd of x in X(Δ) which does not intersect with H(Δ). Therefore, (H(Δ)∩X(Δ))∈SO(X) in X(Δ), and (iv) is satisfied. Thus, construct H(Δ), ∀ ordinal Δ s.t. (i)-(iv) are satisfied. By Berge [3], since G is locally finite, X=X(Δ0) for some ordinal Δ0. Thus, H(Δ0)∈SO(X); and if Δ>Δ0, H(Δ)=H(Δ) ∩ H(Δ0)= H(Δ0). Let H′= X−H(Δ0). If x∈H′∩X1, then ϝ(x)⊆H′, and if x∈H′∩Xj, where j≠1, then ϝ(X) ∩ H′≠ϕ. Thus, if a play starts with a location in H′, whatever I1 does, players I2, I3, ⋯, I1 can prevent a location in H(Δ0) from ever being reached. However, H(Δ0) ⊇ H(0)= {x:L1(x)≥ξ}, and so Hξ⊆H(Δ0). However, H(Δ0)⊆Hξ by construction, and so H(Δ0)= Hξ. Thus, Hξ∈SC(X).
The assumption of Theorem 4.2 cannot be weakened. As seen in Example 4.1, if X0∉SO(X), the conclusion of Theorem 4.2 is false.
Example 4.1. Players P1 and P2 played on the topological sum of X1 and X2 on a segment (−1,m] of R. Let (x;i) be the point x∈Xi and consider
ϝ(x;i)={(x−1,j)i≠jx>0,ϕx≤0. |
Suppose that I1∈N+ and
L1(x)={1x∈X2andx≤0,0otherwise. |
Due to the fact that L1 is upper s-continuous, G is UT for I1∈N+. The starting locations s.t. I1 may ensure unit gain are {(x;1):0<x≤1,2<x≤3,⋯} ∪ {(x;2):1<x≤2,3<x≤4,⋯}∉SC(X).
Example 4.2 shows that the conclusion of Theorem 4.2 may be true, in general.
Example 4.2. Consider X=X1⨁X2, where X1=R and X2=Y⨁Z, where Y,Z⊆R. Consider (x;1), (x;2) and (x;0) are denoted by X1, Y and Z, respectively. Let
ϝ(x;1)={(x;0)}∪{(y;2):∣x−y∣≤3∣x∣},ϝ(x;2)={(y;1):∣x−y∣≤1/2∣x∣},ϝ(x;0)=ϕ.Then,X0=Z |
Consider I1∈N+ and L1(x;0)=1 at ∣x∣, and f1=0, otherwise. Although G is upper TG for I1∈N+ and X0∈SO(X), it is not LF. The locations defined in X1 from which I1 may ensure unit gain are as follows: ∞⋃n=0{(x;1):∣x∣≥1/2n}= {(x;1):∣x∣>0}∉SC(X). However, X=X1⨁X2, and hence the set of beginning locations from which I1 may ensure unit gain is not included in SC(X).
Corollary 4.1. If G is UT for I1∈N−, then the set of locations where I1 can guarantee ξ which is semi-closed is UT.
Proof. Let Aξ be the set of start locations s.t. I1 cannot guarantee ξ. Similar to Theorem 4.1, construct A∈SO(X) s.t. {x:L1(x)<ξ} ⊆ A⊂Aξ. Then, Ac∈SC(X), where Ac=X−A. If x∈Ac∩X1, then ϝ(x)∩Ac≠ϕ, and if x∈Ac∩Xj s.t. j≠1, then ϝ(x)⊆ Ac. So, if a play starts with a location in Ac, I1 can ascertain that a location in H is never gained. Thus, if Hξ is the set of start locations s.t I1 may guarantee ξ, Hξ⊇Ac. However, Aξ⊇A and Hξ ∩ Aξ= ϕ and so Hξ= Ac. Therefore, Hξ∈SC(X).
Corollary 4.2. Let G be LF and has a LT dimension for I1∈N−, and X0= {x:ϝ(x)= ϕ}∈SO(X). Then, the set of locations s.t. I1 may be used to strictly guarantee a gain ξ is semi-closed.
Proof. Let Kξ be the start locations s.t. I1 may not strictly guarantee ξ. By a modification in the proof of Theorem 4.2, Kξ∈SC(X). However, if Aξ is the start locations s.t. I1 can strictly guarantee ξ, Aξ= X−Kξ, and so Aξ∈SO(X).
Definition 4.7. Let X0= {x:ϝ(x)= ϕ}, and a strategy for player Ii is a function ℘:(Xi−X0)→X s.t. ℘(x)∈ϝ(x), ∀ x∈Xi−X0. The play of G is completely determined by its strategy.
Definition 4.8. A strategy ℘ for player I1 is guarantee him with ξ from a start location x if play begins with x and I1 employs a strategy ℘. He receives a payoff ≥ξ regardless of the strategies used by other players.
Definition 4.9. Let Ψ(x)= sup{ξ:x∈Hξ}, where x∈X, and Hξ is the locations, for each ξ s.t. I1 may guarantee ξ. A strategy for player I1 is optimal if it guarantees Ψ(x) from the start location x, ∀ x∈X.
Now, assume that Υ represents the techniques used by player I1. Given that each strategy for I1 is a function between X1−X0 and X. If X(X1−X0) is denoted by functions from X1−X0 to X, then Υ⊆X(X1−X0). In this case, Υ has a relative product topology.
Theorem 4.3. Suppose that only one of the following holds:
(i) G is LF and UT for I1∈N+ s.t. X0∈SO(X);
(ii) ϝ an upper TG for I1∈N−. If ϝ(x) is s-comp, ∀ x∈X1−X0, then the optimal strategies for I1 is nonempty and SC(X) in Υ
Proof. Let ϝ(x) be s-comp. Using Definition 1.2 ∀ x∈X1−X0, Υ= ∏x∈X1−X0ϝ(x) is s-comp. Let Sξ be the strategies s.t. I1 may guarantee ξ from any start point in Hξ. Clearly, Sξ≠ϕ if Hξ≠ϕ. It is sufficient to prove that Sξ∈SC(X) in Υ. Suppose ℘∈Υ, ℘∉Sξ. Then, for some x∈X1∩Hξ, ℘(x)∉Hξ. By assumption (i) and Theorem 4.2 or assumption (b) and Corollary 4.1, we get Hξ∈SC(X), so ∃ a semi-open nbd N of ℘(x) in X s.t. N∩Hξ=ϕ. If M(℘)={δ:δ∈Υ} and δ(x)∈N, M(℘) is a semi-open nbd of ℘, and M(℘) ∩ Sξ= ϕ. Thus, Sξ∈SC(X) in Υ. Let x0∈X, and consider {Sξ:ξ<Ψ(x0)}. Consider ξ1<ξ2< ⋯ <ξn<Ψ(x0). Then, x0∈Hξi, ∀ i, and Hξ1 ⊇ Hξ2 ⊇ ⋯ ⊇ Hξn. Suppose that Hξk ∩ (X1−X0)≠ϕ and that k≤n the greatest integer. Then, for k<j≤n, ϝ(Hξj) ∩ (X1−X0)= ϕ, and Sξj= Υ. Let ℘i∈Sξi for 1≤i≤k, and ℘∈Υ, where for x∈X1−X0,
℘(x)={℘k(x):x∈Hξk℘i(x):x∈Hξi−Hξi+1,i=1,2,⋯,k−1℘1(x):x∈Hξ2 |
Then, ℘∈Sξ−1 ∩ Sξ2 ∩ ⋯ ∩ Sξn. Thus, ∀ x0∈X, {Sξ:ξ<Ψ(x0)}⊆SC(X) with the finite intersection property. Let S(x)= ⋂ξ<ψ(x0)Sξ. So, S(x)∈SC(X). Now, consider {S(x):x∈X}. Suppose that x1,x2,⋯,xn∈X. If Ψ(xm)= max1≤i≤nΨ(xi), S(xm) ⊂ S(xi). Thus, {S(x):x∈X}⊆SC(X) with the finite intersection property. Let S= ⋂x∈XS(x). Thus, S is nonempty and semi-closed in Υ. However, S is an optimal strategy for I1. If ℘∈S(x) ∀ ξ<Ψ(x) and so the guarantee for I1 that is Ψ(x) when the play beginning with x. Thus, if ℘∈⋂x∈XS(x), then ℘ is optimal. Conversely, if ℘ is optimal for I1, ℘ guarantees I1 if the play starts with x, and so ℘∈⋂ξ<Ψ(x)Sξ. This holds for x∈X, and so ℘∈S= ⋂x∈X⋂ξ<Ψ(x)Sξ.
The representation of multifunctions using α-irresoluteness and topological game theory are investigated and discussed. Moreover, new properties of upper (lower) α-irresoluteness due to Neubrunn [30] and Noiri and Nasef [31] are modified and analyzed. The strategy for the play in topological games is completely determined.
The researchers would like to thank the Deanship of Scientific Research, Qassim University, for funding the publication of this project.
The authors declare that they have no competing interests.
[1] | D. Andrijevic, On SPO-equivalent topologies, Suppl. Rend. Cir. Mat. Palermo, 29 (1992), 317–328. |
[2] |
M. Atef, A. A. El Atik, A. Nawar, Fuzzy topological structures via fuzzy graphs and their applications, Soft Comput., 25 (2021), 6013–6027. https://doi.org/10.1007/s00500-021-05594-8 doi: 10.1007/s00500-021-05594-8
![]() |
[3] | C. Berge, Topological games with perfect information, Contrib. Theory Games, 3 (1957), 165–178. |
[4] |
J. Cao, W. Moors, I. Reilly, Topological properties defines by games and their applications, Topol. Appl., 123 (2002), 47–55. https://doi.org/10.1016/S0166-8641(01)00168-7 doi: 10.1016/S0166-8641(01)00168-7
![]() |
[5] | S. G. Crossley, S. K. Hildebrand, Semi-closure, Texas J. Sci., 22 (1971), 99–112. |
[6] | C. Dorsett, Semi-convergence and compactness, Indian J. Mech. Math., 19 (1981), 11–17. |
[7] | A. A. El Atik, A study of some types of mappings on topological spaces, Master's Thesis, Faculty of Science, Tanta University, 1997. |
[8] | A. A. El Atik, On some types of faint continuity, Thai J. Math., 9 (2012), 83–93. |
[9] | A. A. El Atik, Point α-open games and its equivalences, Eur. J. Sci. Res., 136 (2015), 312–319. |
[10] | A. A. El Atik, On irresolute multifunctions and games, JMEST, 2 (2015), 571–575. |
[11] |
A. A. El Atik, Approximation of self similar fractals by α topological spaces, J. Comput. Theor. Nanos., 13 (2016), 8776–8780. https://doi.org/10.1166/jctn.2016.6041 doi: 10.1166/jctn.2016.6041
![]() |
[12] | A. A. El Atik, Pre-θ-irresolute multifunctions and its applications, South Asian J. Math., 6 (2016), 64–71. |
[13] |
A. A. El Atik, New types of winning strategies via compact spaces, J. Egypt. Math. Soc., 25 (2017), 167–170. https://doi.org/10.1016/j.joems.2016.12.003 doi: 10.1016/j.joems.2016.12.003
![]() |
[14] |
A. A. El Atik, R. A. Hosny, More properties on continuous multifunctions, J. Comput. Theor. Nanos., 15 (2018), 1368–1372. https://doi.org/10.1166/jctn.2018.7218 doi: 10.1166/jctn.2018.7218
![]() |
[15] |
A. A. El Atik, A. S. Wahba, Topological approaches of graphs and their applications by neighborhood systems and rough sets, J. Intell. Fuzzy Syst., 39 (2020), 6979–6992. https://doi.org/10.3233/JIFS-200126 doi: 10.3233/JIFS-200126
![]() |
[16] |
A. A. El Atik, A. A. Nasef, Some topological structures of fractals and their related graphs, Filomat, 34 (2020), 153–165. https://doi.org/10.2298/fil2001153a doi: 10.2298/fil2001153a
![]() |
[17] |
A. A. El Atik, H. Z. Hassan, Some nano topological structures via ideals and graphs, J. Egypt. Math. Soc., 28 (2020), 41. DOI: 10.1186/s42787-020-00093-5 doi: 10.1186/s42787-020-00093-5
![]() |
[18] |
A. A. El Atik, A. W. Aboutahoun, A. Elsaid, Correct proof of the main result in "The number of spanning trees of a class of self-similar fractal models" by Ma and Yao, Inform. Process. Lett., 170 (2021), 106117. https://doi.org/10.1016/j.ipl.2021.106117 doi: 10.1016/j.ipl.2021.106117
![]() |
[19] |
A. A. El Atik, A. Nawar, M. Atef, Rough approximation models via graphs based on neighborhood Systems, Granul. Comput., 6 (2021), 1025–1035. https://doi.org/10.1007/s41066-020-00245-z doi: 10.1007/s41066-020-00245-z
![]() |
[20] | A. A. El Atik, I. K. Halfa and A. Azzam, Modelling pollution of radiation via topological minimal structures, T. A Razmadze Math. In., 175 (2021), 33–41. |
[21] | J. Ewert, T. Lipski, Quasi-continuous multivalued mapping, Math. Slovaca, 33 (1983), 69–74. |
[22] |
M. K. El-Bably, A. A. El Atik, Soft β-rough sets and their application to determine COVID-19, Turk. J. Math., 45 (2021), 1133–1148. https://doi.org/10.3906/mat-2008-93 doi: 10.3906/mat-2008-93
![]() |
[23] |
S. Garcia-Ferreira, R. A. Gonzalez-Silva, Topological games defined by ultrafilters, Topol. Appl., 137 (2004), 159–166. https://doi.org/10.1016/S0166-8641(03)00205-0 doi: 10.1016/S0166-8641(03)00205-0
![]() |
[24] | A. M. Kozae, A. A. El Atik, S. Haroun, More results on rough sets via neighborhoods of graphs with finite path, J. Phys. Conf. Ser., 1897 (2021), 012049. |
[25] |
N. Levine, Semi-open sets and semi-continuity in topological spaces, Am. Math. Mon., 70 (1963), 36–41. https://doi.org/10.1080/00029890.1963.11990039 doi: 10.1080/00029890.1963.11990039
![]() |
[26] |
A. S. Mashhour, I. A. Hasanein, S. N. El-Deeb, α-Continuous and α-open mappings, Acta Math. Hung., 41 (1983), 213–218. https://doi.org/10.1007/bf01961309 doi: 10.1007/bf01961309
![]() |
[27] |
K. Martin, Topological games in domian theory, Topol. Appl., 129 (2003), 177–186. https://doi.org/10.1016/S0166-8641(02)00147-5 doi: 10.1016/S0166-8641(02)00147-5
![]() |
[28] | S. N. Maheshwari, S. S. Thakur, On α-compact spaces, Bull. Inst. Math. Acad. Sinica, 15 (1985), 340–347. |
[29] |
O. Njástad, On some classes of nearly open sets, Pac. J. Math., 15 (1965), 961–970. https://doi.org/10.2140/pjm.1965.15.961 doi: 10.2140/pjm.1965.15.961
![]() |
[30] | T. Neubrunn, Srongly quasi-continuous multivalued mappings, In: General topology and its relations to modern analysis and algebra Ⅵ, Berlin: Heldermann Verlag, 1988,351–359. |
[31] | T. Noiri, A. A. Nasef, On upper and lower α-irresolute multifunctions, Res. Rep. Yatsushiro Nat. Coll. Tech., 20 (1997), 105–110. |
[32] |
A. R. Pears, On topological games, Math. Proc. Cambridge, 61 (1965), 165–171. https://doi.org/10.1017/S0305004100038755 doi: 10.1017/S0305004100038755
![]() |
[33] | V. Popa, T. Noiri, Some properties of irresolute multifunctions, Mat. Vesnik, 43 (1991), 11–17. |
[34] | L. Reilly, M. K. Vamanamyrthy, Connectedness and strong semi-continuity, Časopis Pêst. Mat., 109 (1984), 261–265. |
[35] | R. Telgársky, Spaces defined by topological games, Fund. Math., 88 (1975), 193–223. |
[36] |
Y. Yajima, Topological games and applications, North-Holland Math. Library, 41 (1989), 523–562. https://doi.org/10.1016/S0924-6509(08)70159-4 doi: 10.1016/S0924-6509(08)70159-4
![]() |
1. | Yicheng Wei, Junzo Watada, Zijin Wang, Topology Unveiled: A New Horizon for Economic and Financial Modeling, 2025, 13, 2227-7390, 325, 10.3390/math13020325 |