Next Article in Journal
Green Supply Chain Management with Nash Bargaining Loss-Averse Reference Dependence
Next Article in Special Issue
An Improved Alternating CQ Algorithm for Solving Split Equality Problems
Previous Article in Journal
On the Search for a Measure to Compare Interval-Valued Fuzzy Sets
Previous Article in Special Issue
Sehgal–Guseman-Type Fixed Point Theorem in b-Rectangular Metric Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Existence and Generic Stability of Strong Noncooperative Equilibria of Vector-Valued Games

1
College of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming 650221, China
2
Center for General Education, China Medical University, Taichung 40402, Taiwan
3
School of Fundamental Sciences, Yunnan Open University, Kunming 650223, China
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(24), 3158; https://doi.org/10.3390/math9243158
Submission received: 14 November 2021 / Revised: 1 December 2021 / Accepted: 3 December 2021 / Published: 7 December 2021
(This article belongs to the Special Issue Fixed Point, Optimization, and Applications II)

Abstract

:
In this paper, we obtain an existence theorem of general strong noncooperative equilibrium point of vector-valued games, in which every player maximizes all goals. We also obtain an existence theorem of strong equilibrium point of vector-valued games with single-leader–multi-follower framework by using the upper semicontinuous of parametric strong noncooperative equilibrium point set of the followers. Moreover, we obtain some results on the generic stability of general strong noncooperative equilibrium point vector-valued games.

1. Introduction

Nash [1,2] introduced the concept of equilibrium solution of noncooperative game theory and established existence theorems of noncooperative games by applying fixed point theorem. Since then, many authors have considered the existence and stability of the solution of general noncooperative games with real-valued payoff functions. Yu [3] investigated existence theorems of solutions of general noncooperative n-person games by using fixed point theorem and Ky Fan inequality, respectively. Simultaneously, the author obtained essential results of solutions for general noncooperative n-person games in the sense of Baire Category. By virtue of a Ky Fan minimax theorem, Yao [4] investigated an existence theorem of general Nash equilibrium points. Yang and Pu [5] obtained the existence and generic stability for minimax regret equilibria by using a fixed point theorem. Pang and Fukushima [6] introduced a class of multi-leader–follower game problems. Later, Yu and Wang [7] obtained an existence theorem of noncooperative equilibria for two-leader–two-follower games with the assumption of convexity on the set of parametric Nash equilibria of the followers. Ding [8] investigated some existence theorems of noncooperative equilibria for multi-leader–follower games in noncompact FC-spaces. Yang and Ju [9] investigated the existence and generic stability of cooperative equilibria for multi-leader–multi-follower games. Yang and Zhang [10] investigated the existence of the solution and essential components for population game problems. Park [11] obtained some of general fixed point theorems on topological vector space for set-valued mappings. Yu and Peng [12] obtained generic stability of Nash equilibria for noncooperative differential games. Voorneveld et al. [13] introduced the ideal Nash equilibria for finite-criteria games by the feasible-criterion mapping. Later, some authors [14,15] obtained some existence theorems for ideal Nash equilibria for finite-criteria games by applying a maximal element theorem.
In many practical problems, the players’ decisions are often guided by multiple goals, in which the players’ objective is represented by a partial order. For example, in population games, multiple goals are considered, such as individual payoff, social position, life satisfaction and so on. Specifically, Shapley and Rigby [16] first introduced the notion of Pareto–Nash equilibria in multicriteria games. Yang and Yu [17] obtained an essential component of the set of its weakly Pareto–Nash equilibrium points by a Ky Fan inequality of vector-valued functions. Jia et al. [18] obtained existence and stability of weakly Pareto–Nash equilibrium for generalized multiobjective multi-leader–follower games. Hung et al. [19] considered the generic stability of vector quasi-equilibrium problems on Hadamard manifolds. Note that these results require that the ordering cone has a nonempty interior, owing to the concept of Pareto solution. However, in many cases, the ordering cone has an empty interior. For example, in the normed space l p and L p ( Ω ) ( 1 < p < ), the positive cone has an empty interior. So, Gong [20,21] investigated some minimax theorem and existence theorems of Ky Fan points of strong solution for vector-valued mappings. Long et al. [22] obtained existence theorems and stability of solutions for generalized Ky Fan points of strong solution. Moreover, Li et al. [23,24] investigated some saddle point theorems and minimax theorems in lexicographic order. Recently, Zhang et al. [25] investigated existence theorems of general n-person noncooperative game problems and minimax regret equilibria problems with set payoff.
Motivated by these earlier work, we obtain an existence theorem of general strong noncooperative equilibrium point of vector-valued games, in which every player maximizes all goals by a partial order. We also obtain an existence theorem of strong equilibrium point of vector-valued games with single-leader–multi-follower framework by using the upper semicontinuous of parametric strong noncooperative equilibrium point set of the followers. Moreover, we obtain some results on the generic stability of general strong noncooperative equilibrium point of vector-valued games. We do not need the condition that the ordering cone has a nonempty interior. Hence, these results obtained are different from ones in the literature.

2. Preliminaries

We assume that V , E , E i , i = 1 , 2 , , n are real locally convex Hausdorff topological vector spaces. Some basic concepts are presented as follows. Assume that S is a pointed closed convex cone in V.
Definition 1
([21,26]). Let A be a nonempty subset of V.
(i) 
A point z A is said to be a strong maximal point of A if z z S , z A , and M a x s A denotes the set of all strong maximal points of A with respect to the cone S.
(ii) 
A point z A is said to be a strong minimal point of A if z z + S , z A , and M i n s A denotes the set of all strong minimal points of A with respect to the cone S.
Clearly, if M a x s A ( M i n s A ) , the M a x s A ( M i n s A ) is a singleton set.
Definition 2
([20,21]). Let A be a nonempty subset of E and f : A V be a vector-valued mapping.
(i) 
f is said to be lower semicontinuous on A, if for any z Z , the level set { x A : f ( x ) z S } is closed;
(ii) 
f is said to be upper semicontinuous on A, if for any z Z , the level set { x A : f ( x ) z + S } is closed;
Note that if f is S-lower semicontinuous (see Definition 1 in [20]), then f is lower semicontinuous, but not vice versa (see Lemma 1 in [20]).
Definition 3
([21,27]). Let A E be a nonempty convex subset and f : A V be a vector-valued mapping.
(i) 
f is said to be S-quasiconcave on A, if for any z V , the level set
L e v f ( z ) : = { x X 0 : f ( x ) z + S }
is convex. f is said to be S-quasiconvex if f is S-quasiconcave.
(ii) 
f is said to be properly S-quasiconcave on X 0 , if for any x 1 , x 2 A and l [ 0 , 1 ] ,
f ( l x 1 + ( 1 l ) x 2 ) f ( x 1 ) + S o r f ( l x 1 + ( 1 l ) x 2 ) f ( x 2 ) + S .
f is said to be properly S-quasiconvex if f is properly S-quasiconcave.
Remark 1.
If f is a real-valued function and S R + , then S-quasiconcave and properly S-quasiconcave reduce to the quasiconcave of real-valued functions. However, for vector-valued mapping f, these ones are different. Clearly, if f is properly S-quasiconcave, then f is also S-quasiconcave, but not vice versa. The following example explains this case.
Example 1.
Let A = [ 0 , 1 ] R and S = R + 2 . Define vector-valued mapping f : A R 2 as follows:
f ( x ) = ( x , ( x 1 ) 2 ) , x A .
Clearly, f is S-quasiconcave. Nevertheless, take x 1 = 0 , x 2 = 1 , l ¯ = 1 2 ; we have
f ( l ¯ x 1 + ( 1 l ¯ ) x 2 ) = ( 1 2 , 1 4 ) f ( x 1 ) + R + 2 = ( 0 , 1 ) + R + 2
and
f ( l ¯ x 1 + ( 1 l ¯ ) x 2 ) = ( 1 2 , 1 4 ) f ( x 2 ) + R + 2 = ( 1 , 0 ) + R + 2 .
Hence, f is not properly R + 2 -quasiconcave.
The following assumption plays a very important role on the existence of a strong solution for vector-valued mappings.
Definition 4
([20,21,28]). Let A be a nonempty subset of V and f : A V be a vector-valued mapping. f is said to be downward directed on A, if for each x 1 , x 2 A such that x ¯ A
f ( x ¯ ) f ( x 1 ) S , f ( x ¯ ) f ( x 2 ) S .
Note that if f is lower semicontinuous and properly S-quasiconvex, then f is downward directed (see [21]).
Lemma 1
([21]). Let A be a nonempty compact subset of V and f : A V be a vector-valued mapping. If the following conditions hold:
(i) 
f is upper semicontinuous on A;
(ii) 
f is downward directed on A;
then M a x s x A .
Definition 5
([29]). Let F : E 2 V be a set-valued mapping.
(i) 
The nonempty compact-valued set-valued map F is said to be upper semicontinuous (u.s.c.) at x 0 E if for any net { x α } E with x α x 0 and for any y α F ( x α ) , there exist y 0 F ( x 0 ) and a subnet { y β } of { y α } , such that y β y 0 .
(ii) 
The set-valued map F is said to be lower semicontinuous (l.s.c.) at x 0 E , if for any net { x α } E with x α x 0 and for any y 0 F ( x 0 ) , there exists y α F ( x α ) such that y α y 0 .
(iii) 
The set-valued map F is said to be continuous at x 0 E , if F is both u.s.c. and l.s.c. at x 0 .
Theorem 1
([30,31]). Let E be a real locally convex Hausdorff topological vector space. Let X 0 be a nonempty compact convex subset of E. If T : X 0 2 X 0 is u.s.c., and for any x X 0 , T ( x ) is a nonempty, closed and convex set, then T has a fixed point.

3. Existence

In this section, we first investigate the existence results of the strong noncooperative equilibrium point of vector-valued games.
Next we depict general n-person strong noncooperative games with vector payoffs.
Let N = { 1 , 2 , , n } be a set of players, and f i : X = i = 1 n X i V be the ith player’s vector payoff function. For each i N , let X i : = j N \ { i } X j and K i : X i 2 X i be nonempty set-valued mapping with respect to the ith player. A strategy x i * K i ( x i * ) is called a strong noncooperative equilibrium point vector-valued game if the following system holds: For each i N
f i ( x i * , x i * ) = M a x s x i K i ( x i * ) f i ( x i , x i * ) ,
where x i * = ( x 1 * , , x i 1 * , x i + 1 * , x n * ) X i .
Remark 2.
(i) In this game, every player maximizes all his goals. If V = R , S = R + and the set-valued mapping K i X i , the above game problem reduces to the well-known Nash equilibrium problem of the real-valued function (see [1,2]).
(ii) 
If N = { 1 , 2 } , f 2 = f 1 , and the constraint correspondence K i X i , the strong Nash equilibrium point with vector payoff x * = ( x 1 * , x 2 * ) reduces to the strong saddle point in [21].
(iii) 
If V = R n , N = { 1 , 2 } , f 2 = f 1 , the set-valued mapping K i X i and S is the lexicographic cone (not closed; see [23]), the strong Nash equilibrium point with vector payoff x * = ( x 1 * , x 2 * ) reduces to the lexicographic saddle point in [23,24].
Lemma 2.
For i N , let f i : X = i = 1 n X i V be a vector-valued mapping and K i : X i 2 X i be a set-valued mapping. Let Φ i ( x i ) : = M a x s x i K i ( x i ) f i ( x i , x i ) .
(i) 
If f i is lower semicontinuous and K i is l.s.c., then Φ i ( x i ) is lower semicontinuous;
(ii) 
If f i is upper semicontinuous and K i is u.s.c. compact valued, then Φ i ( x i ) is upper semicontinuous;
Proof. 
(i) We only need to verify that for any z V , the level set
L e v ( Φ i ) : = { x i X i : Φ i ( x i ) z S }
is closed. Let the net { x α i } L e v ( Φ i ) and x α i x 0 i . Suppose that x 0 i L e v ( Φ i ) . There exists x 0 i K i ( x 0 i ) such that
f i ( x 0 i , x 0 i ) z S .
For the above x 0 i K i ( x 0 i ) , by the l.s.c. of K i , there exists x α i K i ( x α i ) satisfying x α i x 0 i . Since the net { x α i } L e v ( Φ i ) ,
f i ( x α i , x α i ) z S .
By lower semicontinuous of f i ,
f i ( x 0 i , x 0 i ) z S .
This is a contradiction and hence Φ i lower semicontinuous.
(ii) We only need to verify that for any z V , the level set
L e v ( Φ i ) : = { x i X i : Φ i ( x i ) z + S }
is closed. Let the net { x α i } L e v ( Φ i ) and x α i x 0 i . Since { x α i } L e v ( Φ i ) , there exists x α i ¯ K i ( x α i ) such that
f i ( x α i ¯ , x α i ) z + S .
For the above x α i ¯ K i ( x α i ) , by the u.s.c. of K i , there exist x 0 i ¯ K i ( x 0 i ) and a subnet { x β i ¯ } of { x α i ¯ } satisfying x β i ¯ x 0 i ¯ . By the upper semicontinuous of f i ,
f i ( x 0 i ¯ , x 0 i ) z + S .
Thus,
Φ i ( x 0 i ) z + S .
Namely, x 0 i L e v ( Φ i ) and hence Φ i upper semicontinuous. This completes the proof. □
First, we give an existence result for strong noncooperative equilibrium point of vector-valued games.
Theorem 2.
For each i N , let E i be a real locally convex Hausdorff topological vector space and X i E i be a nonempty compact convex subset. Let f i : Π i = 1 n X i V be the ith player’s vector payoff function and K i : X i 2 X i be the set-valued mapping with respect to the ith player. The following conditions are satisfied:
(i) 
x i X i , f i ( · , x i ) is downward directed on K i ( x i ) ;
(ii) 
f i is continuous on Π i = 1 n X i ;
(iii) 
K i is continuous with nonempty convex compact valued;
(iv) 
x i X i , f i ( · , x i ) is S-quasiconcave.
Then, there is at least a general strong Nash equilibrium point with vector payoff relative to { ( K i , f i ) } i N .
Proof. 
For each i N , define the set-valued mapping G i : X i 2 X i as follows:
G i ( x i ) = { y i K i ( x i ) : f i ( x i , x i ) f i ( y i , x i ) S , x i K i ( x i ) } , x i X i .
By assumptions and Lemma 1, for each x i X i , there exists y i ¯ X i such that
f i ( y i ¯ , x i ) = M a x s x i K i ( x i ) f i ( x i , x i ) .
So, for any i N and x i X i , G i ( x i ) is nonempty.
For each i N and x i X i , let a net { y α i : α I } G i ( x i ) and y α i y 0 i . We have for each x i K i ( x i ) ,
f i ( y α i , x i ) f i ( x i , x i ) + S .
By the continuity of f i , for each x i K i ( x i ) ,
f i ( y 0 i , x i ) f i ( x i , x i ) + S .
Thus, y 0 i G i ( x i ) and hence G i ( x i ) is a closed set.
Let us next prove that for each i N , G i is convex valued. Let y 1 i , y 2 i G i ( x i ) and t [ 0 , 1 ] . By the definition of G i , for any x i K i ( x i ) ,
y 1 i K i ( x i ) , f i ( y 1 i , x i ) f i ( x i , x i ) + S
and
y 2 i K i ( x i ) , f i ( y 2 i , x i ) f i ( x i , x i ) + S .
Since K i is convex valued and f i ( · , x i ) is S-quasiconcave, we have for any x i K i ( x i ) ,
t y 1 i + ( 1 t ) y 2 i K i ( x i ) , f i ( t y 1 i + ( 1 t ) y 2 i , x i ) f i ( x i , x i ) + S .
Namely, t y 1 i + ( 1 t ) y 2 i G i ( x i ) and hence G i ( x i ) is a convex set.
Let us now prove that for each i N , G i is u.s.c. on X i . Since X i is compact, it is sufficient to show that G i is a closed map (see [29]). Let a net
{ ( x α i , y α i ) } G r a p h G i : = { ( x i , y i ) i = 1 n X i : f i ( y i , x i ) = M a x s x i K i ( x i ) f i ( x i , x i ) }
and ( x α i , y α i ) ( x 0 i , y 0 i ) . By the definition of G r a p h G i ,
f i ( y α i , x α i ) = M a x s f i ( K i ( x α i ) , x α i ) .
By the continuity of f i and Lemma 2,
f i ( y 0 i , x 0 i ) = M a x s f i ( K i ( x 0 i ) , x 0 i ) .
Namely, ( x 0 i , y 0 i ) G r a p h G i and hence G i is u.s.c..
Let G = i = 1 n G i . Then, by Kakutani–Fan–Glicksberg fixed point theorem, there exists x * = ( x 1 * , x 2 * , , x n * ) i = 1 n X i such that
x * G ( x * ) ;
i.e., for each i N
f i ( x i * , x i * ) = M a x s x i K i ( x i * ) f i ( x i , x i * ) .
This completes the proof. □
We give the following example to explain that the assumption (i) in Theorem 2 is essential.
Example 2.
Let N = { 1 , 2 } , X 1 = X 2 = [ 1 2 , 1 ] and S = { ( s 1 , s 2 ) R 2 : s 1 0 , s 2 0 | } . Let K 1 X 1 , K 2 X 2 . Let f 1 , f 2 : X 1 × X 2 R 2 be player’s vector payoffs functions:
f 1 ( x 1 , x 2 ) = x 2 ( x 1 , 1 x 1 2 )
and
f 2 ( x 1 , x 2 ) = x 1 ( x 2 , 1 x 2 ) .
Clearly, all conditions of Theorem 2 hold except assumption (i). Indeed, letting x 2 = 1 , f 1 ( x 1 , 1 ) is not downward directed on X 1 . Let x 1 = 1 2 , x 1 = 1 . There is no x ¯ X 1 such that
f 1 ( x ¯ , 1 ) f 1 ( 1 2 , 1 ) + S , f 1 ( x ¯ , 1 ) f 1 ( 1 , 1 ) + S .
We claim that the general strong Nash equilibrium point set is empty. In fact, for each x 1 X 1 , x 2 X 2 ,
M a x S x 1 X 1 f 1 ( x 1 , x 2 ) = , M a x S x 2 X 2 f 2 ( x 1 , x 2 ) = .
Remark 3.
In [13,14,15], these authors investigated the ideal Nash equilibria by the feasible criterion mapping with real-valued payoff functions. The following example illustrates that our results are different from existing results.
Example 3.
Let N = { 1 , 2 } , X 1 = [ 1 2 , 0 ] , X 2 = [ 0 , 1 ] and S = { ( s 1 , s 2 ) R 2 : s 2 | s 1 | } . Let K 1 X 1 , K 2 X 2 . Let f 1 , f 2 : X 1 × X 2 R 2 be player’s vector payoffs functions:
f 1 ( x 1 , x 2 ) = ( f 1 1 , f 1 2 ) = ( x 1 x 2 , 2 x 1 x 2 )
and
f 2 ( x 1 , x 2 ) = ( f 2 1 , f 2 2 ) = ( x 1 x 2 , x 1 ) .
Clearly, all conditions of Theorem 2 hold, namely, Theorem 3.1 is applicable. Indeed, letting x 1 * = 1 2 , x 2 * = 1 ,
f 1 ( x 1 * , x 2 * ) = M a x s x 1 K 1 ( x 2 * ) f 1 ( x 1 , x 2 * )
and
f 2 ( x 1 * , x 2 * ) = M a x s x 2 K 2 ( x 1 * ) f 2 ( x 1 * , x 2 ) .
Namely, ( 1 2 , 1 ) is a general strong Nash equilibrium point with vector payoff. However,
f 1 1 ( x 1 * , x 2 * ) = 1 2 < f 1 1 ( x 1 * , 0 ) = 0 .
Hence, our result are different from ones in [13,14,15].
Remark 4.
In [22], the authors investigated an existence theorem of general Ky Fan points with set-valued mappings F. The following example illustrates that when Theorem 2 in [22] is not applicable, Theorem 2 is applicable.
Example 4.
Let N = { 1 , 2 } , X 1 = [ 0 , 2 ] , X 2 = [ 0 , 1 ] and S = R + 2 . Let K 1 [ 0 , 2 ] , K 2 [ 0 , 1 ] . Let f 1 , f 2 : X 1 × X 2 R 2 be player’s vector payoffs functions:
f 1 ( x 1 , x 2 ) = x 2 ( x 1 , ( x 1 1 ) 2 )
and
f 2 ( x 1 , x 2 ) = x 2 ( x 1 , x 1 2 ) .
Clearly, all conditions of Theorem 2 hold, namely, Theorem 2 is applicable. Indeed, letting x 1 * = 2 , x 2 * = 1 ,
f 1 ( x 1 * , x 2 * ) = ( 2 , 1 ) = M a x s x 1 K 1 ( x 2 * ) f 1 ( x 1 , x 2 * )
and
f 2 ( x 1 * , x 2 * ) = ( 2 , 4 ) = M a x s x 2 K 2 ( x 1 * ) f 2 ( x 1 * , x 2 ) .
Namely, ( 2 , 1 ) is a general strong Nash equilibrium point with vector payoff. Nevertheless, taking x 2 = 1 , x 1 1 = 0 , x 1 2 = 1 , l = 1 2 , we have
f 1 ( l x 1 1 + ( 1 l ) x 1 2 , 1 ) = ( 1 2 , 1 4 ) f 1 ( x 1 1 , 1 ) + R + 2
and
f 1 ( l x 1 1 + ( 1 l ) x 1 2 , 1 ) = ( 1 2 , 1 4 ) f 1 ( x 1 2 , 1 ) + R + 2 .
Thus, f 1 ( · , x 2 ) is not R + 2 -properly quasiconcave. Namely, Theorem 2 in [22] is not applicable.
Let N = { 1 , 2 } , f 2 = f 1 . By Theorem 2, we can obtain the next existence result of general strong saddle point of vector-valued mapping soon.
Theorem 3.
Let E 1 , E 2 be a real locally convex Hausdorff topological vector space and X 1 , X 2 be nonempty compact convex subset of E 1 , E 2 , respectively. Let f : X 1 × X 2 V be a vector payoff function and K 1 : X 2 2 X 1 , K 2 : X 1 2 X 2 be set-valued mappings. The following conditions are satisfied:
(i) 
x 1 X 1 , f ( x 1 , · ) is downward directed on K 2 ( x 1 ) ; x 2 X 2 , f ( · , x 2 ) is downward directed on K 1 ( x 2 ) ;
(ii) 
f is continuous on X 1 × X 2 ;
(iii) 
K 1 , K 2 are continuous with nonempty convex compact valued;
(iv) 
x 1 X 1 , f ( x 1 , · ) is S-quasiconvex; x 2 X 2 , f ( · , x 2 ) is S-quasiconcave.
Then, there exist x 1 * K 1 ( x 2 * ) and x 2 * K 2 ( x 1 * ) such that
f ( x 1 * , x 2 * ) = M a x s x 1 K 1 ( x 2 * ) f ( x 1 , x 2 * ) = M i n s x 2 K 2 ( x 1 * ) f ( x 1 * , x 2 ) .
Remark 5.
When K 1 X 1 and K 2 X 2 , the above result reduces to Theorem 1 in [21].
In the following, we investigate the existence results for general strong noncooperative equilibrium point of vector-valued games with single-leader–multi-follower framework.
Next, we depict general strong noncooperative equilibria of vector-valued games with single-leader–multi-follower framework.
The leaders and the followers choose their strategies in sequence. After knowing the leaders’ strategy y Y , the followers play a parametric game. Let N = { 1 , 2 , , n } be a set of followers. Let X i be the pure strategy set of the ith follower and Y be the pure strategy set of the leader. Let F i : Y × i = 1 n X i V be the parametric vector payoff function of the ith follower, Θ i : Y × X i 2 X i be the parametric set-valued mapping of the ith follower and Γ : Y × i = 1 n X i V be the vector payoff function of the leader. We define S ( y ) as the complete set of strong noncooperative equilibrium point of the followers:
S ( y ) = { x * i = 1 n X i : F i ( y , x i * , x i * ) = M a x s x i Θ i ( y , x i * ) F i ( y , x i , x i * ) , i N } , y Y .
A strategy ( y * , x * ) is called a strong noncooperative equilibrium point of vector-valued games with single-leader–multi-follower framework if the following equality holds:
Γ ( y * , x * ) = M a x s y Y , x S ( y ) Γ ( y , x ) .
First, we prove that S ( y ) is u.s.c. and compact valued.
Lemma 3.
Assume that S ( y ) , y Y . Let X i be a compact set, i N . For each i N , if F i : Y × i = 1 n X i V is continuous and Θ i : Y × X i 2 X i is continuous with nonempty compact valued, then S is u.s.c. and compact valued.
Proof. 
Since X is compact, it is sufficient to show that Graph(S) is closed. Let a net { ( y α , x α ) } G r a p h ( S ) and ( y α , x α ) ( y 0 , x 0 ) . By the definition of S ( y ) , for each i N ,
F i ( y α , x α i , x α i ) = M a x s F i ( y α , Θ i ( y α , x α i ) , x α i ) .
Since F i and Θ i are continuous, by Lemma 2,
F i ( y 0 , x 0 i , x 0 i ) = M a x s F i ( y 0 , Θ i ( y 0 , x 0 i ) , x 0 i ) .
Namely, ( y 0 , x 0 ) G r a p h ( S ) , i.e., S is u.s.c.
By assumptions, it is easy to prove that S is closed valued. Since X is compact, S is compact valued. This completes the proof. □
Next, we give an existence result for general strong noncooperative equilibria of vector-valued games with single-leader–multi-follower framework.
Theorem 4.
For each i N , let E i be a real locally convex Hausdorff topological vector space and X i E i be a nonempty compact convex subset. Let Y be a compact set. The following conditions are satisfied:
(i) 
x i X i , F i ( · , x i ) is downward directed on Θ i ( x i ) ; Γ is downward directed on Y × i = 1 n X i ;
(ii) 
F i is continuous with nonempty compact values and Θ i is continuous with nonempty convex compact values;
(iii) 
Γ is upper semicontinuous;
(iv) 
y Y , x i X i , F i ( y , · , x i ) is S-quasiconcave.
Then, there is at least a general strong Nash equilibrium point of of vector-valued games with single-leader–multi-follower framework.
Proof. 
Define a function Φ ( y ) : Y V ,
Φ ( y ) : = M a x s x S ( y ) Γ ( y , x ) .
Since Γ is upper semicontinuous and Γ is downward directed, by Lemma 1, Φ ( y ) is well defined. By Theorem 2 and Lemma 3, for each y Y , S ( y ) is u.s.c. nonempty compact valued. Thus, by the upper semicontinuity of Γ and Lemma 2, the function Φ is upper semicontinuous. Since Y is compact and Γ is downward directed, by Lemma 1, there exists y * Y such that
Φ ( y * ) = M a x s y Y Φ ( y ) .
Take x * S ( y * ) satisfying Γ ( y * , x * ) = Φ ( y * ) . Namely, ( y * , x * ) is a general strong Nash equilibrium point of single-leader–multi-follower games with vector payoff. This completes the proof. □
Remark 6.
When F i , Γ is real-valued functions and S = R + , condition (i) holds naturally. Hence, if V = R , S = R + and Θ i X i , the above result reduces to Corollary 3.8 in [18].

4. Generic Stability

In this section, we investigate the stability of strong noncooperative equilibrium point with vector payoff when the vector payoff functions and constraint correspondence set-valued mappings are perturbed.
For any i N , let E i , V be Banach spaces. Let M be the space of ( f 1 , , f n , K 1 , , K n ) with all assumptions of Theorem 2. For m M , let Ω ( m ) be the set of all strong noncooperation equilibria relative to { ( f i , K i ) } i N .
We define the distance ρ on M by
ρ ( m , m ) : = sup x X i = 1 n f i ( x ) f i ( x ) + sup x i X i i = 1 n h i ( K i ( x i ) , K i ( x i ) ) ,
where m = ( f 1 , , f n , K 1 , , K n ) , m = ( f 1 , , f n , K 1 , , K n ) M and h i is the Hausdorff distance by the norm on E i . Obviously, ( M , ρ ) is a complete metric space.
Definition 6
([5]). Let m M . x Ω ( m ) is said to be an essential point, if for any open neighborhood U of x, there exists δ > 0 such that
U Ω ( m ) ,
for any m M and ρ ( m , m ) < δ . m is said to be essential, if for any x Ω ( m ) , x is an essential point.
For each m M , m is essential if and only if the set-valued mapping Ω : M 2 X is l.s.c. (see Theorem 5 in [5]).
Definition 7
([32]). Let Q be a subset of M.
(i) 
Q is said to be dense if c l Q = M ;
(ii) 
Q is residual if Q = i = 1 Q i , where Q i is an open dense subset of M, i .
Theorem 5.
The set-valued mapping Ω : M 2 X is u.s.c. and compact valued.
Proof. 
Since X i is compact, it is sufficient to show that Graph( Ω ) is closed. Let the net { ( f α 1 , , f α n , K α 1 , , K α n , x α 1 , , x α n ) } G r a p h ( Ω ) and ( f α 1 , , f α n , K α 1 , , K α n , x α 1 , , x α n ) ( f 0 1 , , f 0 n , K 0 1 , , K 0 n , x 0 1 , , x 0 n ) . Hence, for each i N ,
f α i ( x α i , x α i ) = M a x s f α i ( K α i ( x α i ) , x α i ) .
First, we show that for each i N , x 0 i K 0 i ( x 0 i ) . Let d be the distance on X i × X i .
d ( x 0 i , K 0 i ( x 0 i ) ) d ( x 0 i , x α i ) + d ( x α i , K α i ( x α i ) ) + h ( K α i ( x α i ) , K 0 i ( x α i ) ) + h ( K 0 i ( x α i ) , K 0 i ( x 0 i ) ) d ( x 0 i , x α i ) + ρ ( m α , m 0 ) + h ( K 0 i ( x α i ) , K 0 i ( x 0 i ) ) 0 .
Namely, x 0 i K 0 i ( x 0 i ) .
Next, we show that for each i N ,
f 0 i ( x 0 i , x 0 i ) = M a x s f 0 i ( K 0 i ( x 0 i ) , x 0 i ) .
Suppose that this is not true. There exist i N and u 0 i K 0 i ( x 0 i ) such that
f 0 i ( u 0 i , x 0 i ) f 0 i ( x 0 i , x 0 i ) S .
By the closedness of the cone S, there exists an open neighborhood U of θ ,
f 0 i ( u 0 i , x 0 i ) f 0 i ( x 0 i , x 0 i ) + U V \ ( S ) .
By the l.s.c. of K 0 i , for u 0 i K 0 i ( x 0 i ) , there exists u α i K 0 i ( x α i ) such that u α i u 0 i . Since h ( K α i ( x α i ) , K 0 i ( x α i ) ) 0 , we can choose subnets { K β k i } , { x β k i } such that
h ( K β k i ( x β k i ) , K 0 i ( x β k i ) ) < 1 k ,
which implies that there exists u β k i ¯ K β k i ( x β k i ) such that u β k i ¯ u β k i < 1 k . Then,
u β k i ¯ u 0 i u β k i ¯ u β k i + u β k i u 0 i < 1 k + u β k i u 0 i ,
and hence u β k i ¯ u 0 i . Since ( f α 1 , , f α n ) ( f 0 1 , , f 0 n ) by ρ , for the above open neighborhood U, for any sufficiently large β ,
( f β i ( u β i ¯ , x β i ) f β i ( x β i , x β i ) ) ( f 0 i ( u β i ¯ , x β i ) f 0 i ( x β i , x β i ) ) 1 2 U .
By the continuity of f 0 ,
f 0 i ( u β i ¯ , x β i ) f 0 i ( x β i , x β i ) f 0 i ( u 0 i , x 0 i ) f 0 i ( x 0 i , x 0 i ) .
For the open neighborhood ( f 0 i ( u 0 i , x 0 i ) f 0 i ( x 0 i , x 0 i ) + 1 2 U + S ) of f 0 i ( u 0 i , x 0 i ) f 0 i ( x 0 i , x 0 i ) , we have that for any sufficiently large β ,
f 0 i ( u β i ¯ , x β i ) f 0 i ( x β i , x β i ) f 0 i ( u 0 i , x 0 i ) f 0 i ( x 0 i , x 0 i ) + 1 2 U + S .
Thus, we have that for sufficiently large k,
f β k i ( u β k i ¯ , x β k i ) f β k i ( x β k i , x β k i ) = ( f β k i ( u β k i ¯ , x β k i ) f β k i ( x β k i , x β k i ) ) ( f 0 i ( u β k i ¯ , x β k i ) f 0 i ( x β k i , x β k i ) ) + ( f 0 i ( u β k i ¯ , x β k i ) f 0 i ( x β k i , x β k i ) ) f 0 i ( u 0 i , x 0 i ) f 0 i ( x 0 i , x 0 i ) + U + S V \ ( S ) + S = V \ ( S ) ,
which contradicts the fact that { ( f α 1 , , f α n , K α 1 , , K α n , x α 1 , , x α n ) } G r a p h ( Ω ) . Hence, Graph( Ω ) is closed. It is easy concerning that Ω is compact valued. This completes the proof. □
Lemma 4
([33]). Let M be a complete metric space and X be a topological space. Suppose that Ω : M 2 X is compact valued and upper semicontinuous with nonempty values. Then, a dense residual subset Q of M exists such that Ω is lower semicontinuous on Q.
By Definition 6, Lemma 4 and Theorem 5, we obtain the following result immediately.
Theorem 6.
There exists a dense residual set Q M such that m is essential for any m Q .
Remark 7.
The results in [17,18] require that the ordering cone has a nonempty interior, owing to the concept of weakly Pareto solution. Hence, our results are different from ones in the literatures.

5. Concluding Remark

In this paper, by virtue of the Kakutani–Fan–Glicksberg fixed point theorem, we obtain an existence theorem of general strong noncooperative equilibrium point of vector-valued games, in which every player maximizes all goals. Moreover, we establish the upper semicontinuous of parametric strong noncooperative equilibrium point set and the existence of strong equilibrium point of vector-valued games with the single-leader–multi-follower framework. Finally, we obtain some results on the stability of general strong noncooperative equilibrium point vector-valued games when the vector payoff functions and constraint correspondence set-valued mappings are perturbed.

Author Contributions

Y.Z., S.-S.C. and T.C. contributed equally to the writing of this paper. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (No. 11901511), Yunnan Fundamental Research Projects (No. 202101AT070216) and supported by the Center for General Education, China Medical University, Taichung, Taiwan.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors are grateful to the anonymous referees for their valuable comments and suggestions, which improved the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Nash, J.F. Equilibrium points in N-person games. Proc. Natl. Acad. Sci. USA 1950, 36, 48–49. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  2. Nash, J.F. Non-cooperative games. Ann. Math. 1951, 54, 286–295. [Google Scholar] [CrossRef]
  3. Yu, J. Essential equilibria of n-person noncooperative games. J. Math. Econ. 1999, 31, 361–372. [Google Scholar] [CrossRef]
  4. Yao, J.C. Nash equilibria in n-person games without convexity. Appl. Math. Lett. 1992, 5, 67–69. [Google Scholar] [CrossRef] [Green Version]
  5. Yang, Z.; Pu, Y.J. Existence and stability of minimax regret equilibria. J. Glob. Optim. 2012, 54, 17–26. [Google Scholar] [CrossRef]
  6. Pang, J.S.; Fukushima, M. Quasi-variational inequalities, generalized Nash equilibria, and multi-leader–follower games. Comput. Manag. Sci. 2005, 2, 21–56. [Google Scholar] [CrossRef]
  7. Yu, J.; Wang, H.L. An existence theorem of equilibrium points for multi-leader–follower games. Nonlinear Anal. 2008, 69, 1775–1777. [Google Scholar] [CrossRef]
  8. Ding, X.P. Equilibrium existence theorems for multi-leader–follower generalized multiobjective games in FC-spaces. J. Glob. Optim. 2012, 53, 381–390. [Google Scholar] [CrossRef]
  9. Yang, Z.; Ju, Y. Existence and generic stability of cooperative equilibria for multi-leader–multi-follower games. J. Glob. Optim. 2016, 65, 563–573. [Google Scholar] [CrossRef]
  10. Yang, Z.; Zhang, H.Q. Essential stability of cooperative equilibria for population games. Optim. Lett. 2019, 13, 1573–1582. [Google Scholar] [CrossRef]
  11. Park, S. Some general fixed point theorems on topological vector spaces. Appl. Set-Valued Anal. Optim. 2019, 1, 19–28. [Google Scholar]
  12. Yu, J.; Peng, D.T. Generic stability of Nash equilibria for noncooperative differential games. Oper. Res. Lett. 2020, 48, 157–163. [Google Scholar] [CrossRef]
  13. Voorneveld, M.; Grahn, S.; Dufwenberg, M. Ideal equilibria in noncooperative multicriteria games. Math. Methods Oper. 2000, 52, 65–77. [Google Scholar] [CrossRef]
  14. Radjef, M.S.; Fahem, K. A note on ideal Nash equilibrium in multicriteria games. Appl. Math. Lett. 2008, 21, 1105–1111. [Google Scholar] [CrossRef]
  15. Yang, Z.; Meng, D.W.; Wang, A.Q. On the existence of ideal Nash equilibria in discontinuous games with infinite criteria. Oper. Res. Lett. 2017, 45, 362–365. [Google Scholar] [CrossRef]
  16. Shapely, L.S.; Rigby, F.D. Equilibrium points in games with vector payoffs. Nav. Res. Logist. 1959, 6, 57–61. [Google Scholar] [CrossRef]
  17. Yang, H.; Yu, J. On essential components of the set of weakly Pareto–Nash equilibrium. Appl. Math. Lett. 2002, 15, 553–560. [Google Scholar] [CrossRef] [Green Version]
  18. Jia, W.S.; Xiang, S.W.; He, J.H.; Yang, Y.L. Existence and stability of weakly Pareto–Nash equilibrium for generalized multiobjective multi-leader–follower games. J. Glob. Optim. 2015, 61, 397–405. [Google Scholar] [CrossRef]
  19. Hung, N.V.; Dai, L.X.; Köbis, E.; Yao, J.C. The generic stability of solutions for vector quasi-equilibrium problems on Hadamard manifolds. J. Nonlinear Var. Anal. 2020, 3, 427–438. [Google Scholar]
  20. Gong, X.H. Strong vector equilibrium problems. J. Glob. Optim. 2006, 36, 339–349. [Google Scholar]
  21. Gong, X.H. The strong minimax theorem and strong saddle points of vector-valued functions. Nonlinear Anal. 2008, 68, 2228–2241. [Google Scholar] [CrossRef]
  22. Long, X.J.; Huang, N.J.; Teo, K.L. Existence and stability of solutions for generalized strong vector quasi-equilibrium problems. Math. Comput. Model. 2008, 47, 445–451. [Google Scholar] [CrossRef]
  23. Li, X.B.; Li, S.J.; Fang, Z.M. A minimax theorem for vector valued functions in lexicographic order. Nonlinear Anal. 2010, 73, 1101–1108. [Google Scholar] [CrossRef]
  24. Zhang, Y.; Li, S.J. Some minimax problems in lexicographic order. Acta Math. Appl. Sin. Engl. Ser. 2017, 33, 193–200. [Google Scholar] [CrossRef]
  25. Zhang, Y.; Chen, T.; Chang, S.S. Existence of solution to n-person noncooperative games and minimax regret equilibria with set payoffs. Appl. Anal. 2020, 1–16. [Google Scholar] [CrossRef]
  26. Giannessi, F.; Mastroeni, G.; Pellegrini, L. On the theory of vector optimization and variational inequalities. Image space analysis and separation. In Vector Variational Inequalities and Vector Equilibria, Mathematical Theories; Giannessi, F., Ed.; Kluwer Academic Publishers: Amsterdam, The Netherlands, 2000; pp. 153–215. [Google Scholar]
  27. Ferro, F. A minimax theorem for vector-valued functions. J. Optim. Theory Appl. 1989, 60, 19–31. [Google Scholar] [CrossRef]
  28. Martellotti, A.; Salvadori, A. Inequality systems and minimax results without linear structure. J. Math. Anal. Appl. 1990, 148, 79–86. [Google Scholar] [CrossRef] [Green Version]
  29. Aubin, J.P.; Ekeland, I. Applied Nonlinear Analysis; John Wiley and Sons: New York, NY, USA, 1984. [Google Scholar]
  30. Fan, K. Fixed-point and minimax theorems in locally convex topological linear spaces. Proc. Natl. Acad. Sci. USA 1952, 38, 121–126. [Google Scholar] [CrossRef] [Green Version]
  31. Kakutani, S. A generalization of Brouwer’s fixed point theorem. Duke Math. J. 1941, 8, 457–459. [Google Scholar] [CrossRef]
  32. Rudin, W. Functional Analysis, 2nd ed.; McGraw-Hill Inc.: New York, NY, USA, 1991. [Google Scholar]
  33. Fort, M.K., Jr. Points of continuity of semicontinuous functions. Publ. Math. Debr. 1951, 2, 100–102. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zhang, Y.; Chang, S.-S.; Chen, T. Existence and Generic Stability of Strong Noncooperative Equilibria of Vector-Valued Games. Mathematics 2021, 9, 3158. https://doi.org/10.3390/math9243158

AMA Style

Zhang Y, Chang S-S, Chen T. Existence and Generic Stability of Strong Noncooperative Equilibria of Vector-Valued Games. Mathematics. 2021; 9(24):3158. https://doi.org/10.3390/math9243158

Chicago/Turabian Style

Zhang, Yu, Shih-Sen Chang, and Tao Chen. 2021. "Existence and Generic Stability of Strong Noncooperative Equilibria of Vector-Valued Games" Mathematics 9, no. 24: 3158. https://doi.org/10.3390/math9243158

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