1. Introduction
The game theory in economics comes from the pioneering work by von Neumann and Morgenstern [
1]. The game theory mainly concerns the behavior of players whose decisions affect each other. The topic of cooperative games can also be regarded as games in coalitional form. Nash [
2] defined the concept of a general two-person cooperative game and a solution concept of such games. The cooperation means that the players have complete freedom of communication and comprehensive information on the structure of the game. Young [
3] studied the monotonic solutions of cooperative games. The principle of monotonicity for cooperative games states that if a game changes such that some player’s contribution to all coalitions increases or stays the same, then the player’s allocation should not decrease. The well-known Shapley value is a unique symmetric and efficient solution concept that is also monotonic.
In a cooperative game, the payoff of a coalition is assumed to be a real number that can also represent the worth under this coalition. Owing to unexpected situations and fluctuation in the real market, the payoff cannot be measured precisely. In other words, the payoff is uncertain in the real world.
Based on the probability theory, the stochastic payoffs were studied by Fernández et al. [
4], Granot [
5] and Suijs et al. [
6], where the payoffs were assumed to be random variables. The other types of stochastic games were also proposed by Chakrabarti [
7], Alvarez-Mena and Hernández-Lerma [
8], Dshalalow and Huang [
9], Dekel et al. [
10] and Guo and Yang [
11]. A general model of cooperative games whose characteristic function takes values in a partially ordered linear space has also been studied by Puerto et al. [
12].
Another concept of uncertain payoff is to consider the interval-valued payoff in which the uncertain worth of a given coalition is assumed to be located in a bounded closed interval instead of assuming it to be a random variable. The advantage with considering interval-valued payoffs is that the determination of uncertainty is easily performed by simply determining the lower and upper end-points. However, the determination of uncertainty for stochastic payoffs by providing the probability distribution functions is not an easy task.
Applying the interval analysis (ref. Moore [
13]) to the conventional cooperative game establishes the so-called interval-valued cooperative games by referring to Branzei et al. [
14], Alparslan Gok et al. [
15] and Mallozzi et al. [
16]. The cooperative games endowed with the interval-valued payoffs has also been investigated in Alparslan Gök et al. [
17] and the references therein. The inclusion relationship between the interval-valued core and interval-valued dominance core has been established in Alparslan Gök et al. [
17] by showing that the interval-valued core is contained in the interval-valued dominance core. Since the equalities of the interval-valued core and interval-valued dominance core were not established in Alparslan Gök et al. [
17], in this paper, we shall establish the equalities of the interval-valued core and interval-valued dominance core by introducing different types of orderings.
Branzei et al. [
18] considered the interval-valued bankruptcy games that arose from bankruptcy situations with interval-valued claims in which two interval-valued Shapley-like values are proposed and the interrelations using the interval arithmetic operations (ref. Moore [
13]) are studied. Mallozzi et al. [
16] introduced a solution concept of core-like cooperative games in which the fuzzy intervals were taken into account. Also, a necessary condition was provided to assure the non-emptiness of core-like games. The more detailed fuzzy cooperative games can refer to Mares [
19]. On the other hand, Han et al. [
20] proposed the interval-valued core and the interval Shapley-like value of cooperative games by defining a new order relation of intervals. Alparslan Gok et al. [
21] considered the Weber set and the Shapley value for interval-valued cooperative games and established their relations with the interval-valued core of convex interval-valued cooperative games. Branzei et al. [
22] and Alparslan Gok et al. [
17] also studied the interval-valued core, the interval-valued dominance core, the interval-valued square dominance core and the interval-valued stable sets of cooperative games under interval uncertainty. Li et al. [
23,
24,
25] proposed several concepts of interval-valued solutions such as the interval-valued Shapley value, the interval-valued solidarity value and the interval-valued Banzhaf value in which an effective nonlinear programming method for computing interval-valued cores was established. Meng et al. [
26] proposed a generalized form of fuzzy games with interval characteristic functions in which the interval Shapley function and interval population monotonic allocation function were studied.
A bounded closed interval subtracting itself cannot be a zero element. Therefore the additive inverse element of a bounded closed interval does not exist. In this paper, we introduce the concept of a null set that can be used to define the orderings and almost identical concept in the space consisting of all bounded and closed intervals. We also introduce the concept of Hukuhara difference for the bounded closed intervals, which is used to propose the different types of cores and dominance cores. The argument for studying the relationships between the interval-valued core and interval-valued dominance core in this paper is completely different from that of Alparslan Gök et al. [
17], since the concepts of null set and Hukuhara difference are invoked. Especially, based on these settings, we can establish the equalities of the interval-valued core and interval-valued dominance core, which was not studied in Alparslan Gök et al. [
17].
In
Section 2, we propose the concept of a null set and present the interesting properties of bounded closed intervals in
that will be used for the further investigation. We also introduce many types of orderings that will be used to study the interval-valued cores and interval-valued dominance cores. In
Section 3, we introduce the concept of a cooperative game endowed with the interval-valued payoffs. In
Section 4 and
Section 5, based on the different orderings introduced in
Section 2, we propose many types of cores and dominance cores. On the other hand, using the Hukuhara difference, we also introduce the so-called H-cores and dominance H-cores. In
Section 6, we study the relationships between cores and dominance cores. Without considering the individual rationality, in
Section 7, we also study the relationships between pre-cores and dominance pre-cores.
2. Intervals in
We write to denote a bounded closed interval in , where a is the left-endpoint and b is the right-endpoint. The center of is defined by the average of the left-endpoint and right-endpoint. The bounded closed interval can also be regarded as an “approximated real number c” with symmetric uncertainty , where u is the half-width of the bounded closed interval . We denote by the collection of all bounded closed intervals in . For convenience, for any , we write .
Let ⊙ denote any of the four basic arithmetic operations
between two bounded closed intervals
and
. We define
Then we have the following operations:
Since is a bounded closed interval, we also write and to denote the left-endpoint and right-endpoint of , respectively.
In particular, we have
which says that each
is an “approximated zero” with symmetric uncertainty
. Therefore, we say that
is an
interval zero. The
zero interval is defined to be
.
Let
that collects all interval zeros. Equivalently,
if and only if
and
, i.e.,
where the bounded closed interval
is an “approximated zero” with symmetric uncertainty
. We also call
as the
null set in
. It is also clear that the zero interval
is in the null set
.
Remark 1. It is not hard to check that the null set Ω is closed under the interval addition. In other words, for any , we have .
Let A and B be two bounded closed intervals. We say that A and B are almost identical if and only if the centers of A and B are equal. Suppose that their common centers are . Then A and B can both be regarded as the “approximated real number ”. The only difference is the uncertainty. In this case, if then we say that B is more uncertain than A.
For any bounded closed interval and any , we see that A and are almost identical in the sense of being more uncertain than A. Therefore we can define the almost identical concept in below.
Definition 1. Given any two bounded closed intervals A and B, we define if and only if there exist such that .
Remark 2. Suppose that . Since , it can happen that one of the following situations is satisfied:
when ;
there exists such that when and ;
there exists such that when and .
It is clear that . More interpretation regarding the equality is presented below. We first observe that the center of is and the center of is . This says that if then the centers of A and B are all identical. Therefore we may say that means A and B being identical with different symmetric uncertainties.
Proposition 1. Let A and B be two bounded closed intervals.
- (i)
If , then .
- (ii)
If for some , then .
- (iii)
Suppose that and . Then we have the following properties.
If , then .
If for some , then .
Proof. It suffices to prove the second case of part (iii). Since
and
, it follows that
and
for some
for
. If
, then, by adding
on both sides, we have
where
By adding
on both sides, we also have
which implies
Using Remark 1, we obtain
where
This shows , and the proof is complete. □
Definition 2. Let A and B be two bounded closed intervals. We define three binary relations as follows:
if and only if and ;
if and only if ;
if and only if .
Remark 3. It is clear that the above three binary relations are reflexive and transitive on ; that is, they are partial orderings on . We also see that implies , and that implies . If the bounded closed intervals A and B are not degenerated, then cannot imply .
Definition 3. Let A and B be two bounded closed intervals. We define three binary relations as follows:
if and only if and ;
if and only if ;
if and only if .
Therefore we also propose the following defintion.
Definition 4. Let A and B be two bounded closed intervals. We define three binary relations as follows: Remark 4. It is clear to see that implies , that implies , and that implies .
Since can be regarded as a kind of “zero element” in , we also define the following binary relations.
Definition 5. Given any two bounded closed intervals A and B, we definefor some . We can similarly define and . The strict orderingscan also be similarly defined. Suppose that . Since , it can happen that one of the following situations is satisfied:
when ;
there exists such that when and ;
there exists such that when and .
The same situations can also apply to and .
The following different relations of transitivity will be used for discussing the inclusions of cores and dominance cores.
Proposition 2. Let A, B and C be bounded closed intervals. We have the following properties.
- (i)
If then , and if then .
- (ii)
If then , and if then .
- (iii)
If then , and if then .
- (iv)
If then , and if then .
- (v)
If then , and if then .
- (vi)
if then , and if then ;
Proof. To prove part (i), by definition, there exist
such that
. We also have
. Therefore we obtain
which says that
. Without considering
and
, we can similarly obtain that
implies
. The other parts can be similarly obtained. This completes the proof. □
Remark 5. Based on Proposition 2, we can use Remarks 3 and 4 to obtain many other relations of transitivity as follows:
Using (ii), if then , and if then .
Using (i), if then , and if then ;
Using (ii), if then , and if then ;
Using (iii), if then , and if then ;
Using (iv), if then , and if then ;
Using (v), if then , and if then ;
3. Cooperative Games with Interval-Valued Payoffs
We consider a finite set of players. The subsets of N are called the coalitions. We denote by the collection of all coalitions. Let be an interval-valued function defined on .
Then is called a cooperative game with interval-valued payoff if and only if . Given a coalition S, owing to the unexpected situation, the payoff regarding this coalition S is assumed to be uncertain. In other words, the map assigns to each coalition a bounded closed interval telling what such a coalition can achieve in cooperation.
Let be a cooperative game with interval-valued payoff. For any with , we define three types of superadditivity as follows:
We say that
is
⪰-superadditive if and only if
We say that
is
≿-superadditive if and only if
We say that
is
≽-superadditive if and only if
Given a finite set of players, let denote the cardinality of a subset S of N. Therefore we have .
Example 1. We consider a factory with n workers. Assume that each worker is doing the same task. Owing to the unexpected uncertainty and ability, the worker i can earn around dollars, where the statement “around dollars” can be modeled as a bounded closed interval in . Therefore, we set for . Given a coalition , the cooperation for the workers in S shows that there is an extra benefit can be earned, where the benefit depends on the cardinality of the coalition S and the benefit is “around B dollars” for each member.
In this case, the interval-valued payoff can be defined as follows It is also reasonable to define .
4. Cooperative Games with Interval-Valued Payoffs
We consider a finite set of players. The subsets of N are called the coalitions. We denote by the collection of all coalitions. Let be an interval-valued function defined on . Then is called a cooperative game with interval-valued payoff if and only if . Given a coalition S, owing to the unexpected situation, the payoff regarding this coalition S is assumed to be uncertain. In other words, the map assigns to each coalition a bounded closed interval telling what such a coalition can achieve in cooperation.
Let be a cooperative game with interval-valued payoff. For any with , we define three types of superadditivity as follows:
We say that
is
⪰-superadditive if and only if
We say that
is
≿-superadditive if and only if
We say that
is
≽-superadditive if and only if
Given a finite set of players, let denote the cardinality of a subset S of N. Therefore we have .
Example 2. We consider a factory with n workers. Assume that each worker is doing the same task. Owing to the unexpected uncertainty and ability, the worker i can earn around dollars, where the statement “around dollars” can be modeled as a bounded closed interval in . Therefore, we set for . Given a coalition , the cooperation for the workers in S shows that there is an extra benefit can be earned, where the benefit depends on the cardinality of the coalition S and the benefit is “around B dollars” for each member. In this case, the interval-valued payoff can be defined as follows It is also reasonable to define .
5. Cores of Cooperative Game with Interval-Valued Payoffs
Given a finite set
of players, we write
to denote the
-dimensional vector in the product set
given by
Let
be a cooperative game with interval-valued payoff. The set of
pre-imputation of
is denoted and defined by
Suppose that the individual rationality is considered. The different sets of
imputation of
are defined by
and
We can similarly define , , and based on the different binary relations.
It is clear that , and .
Using Remark 3, we see that .
Example 3. Continued from Example 2, we have Therefore the pre-imputation is given by The imputation of are also given byand Let be a cooperative game with interval-valued payoff. In order to define the core of . We first define the concept of anti-core.
The different types of
anti-core of
are denoted and defined as follows. Under the set of imputation
, we define
and
Under the set of imputation
, we define
and
Since
implies
, we have the inclusion
Based on the different binary relations, we can similarly define the other types of anti-core. For example, it is clear to see that
Now the
core of
is defined to be the complement set of anti-core with respect to the corresponding set of imputation. More precisely, the
core of
is denoted and defined by
and the core
of
is denoted and defined by
It is also clear to see that
Equivalently, we also see that
and
Given any two bounded closed intervals A and B. If there exists another bounded closed interval C satisfying , then we say that the Hukuhara difference between A and B exists, and we write . It is clear to see that and .
Based on the Hukuhara difference, we also want to define the anti-cores and core of a cooperative game with interval-valued payoff. Under the set of imputation
, the
H-anti-cores of
are denoted and defined by
and
The
H-cores of
are denoted and defined by
More precisely, we have
and
Based on the different binary relations, we can similarly define the other types of H-core of . Using Remarks 3 and 4, we can obtain many inclusions regarding the different types of cores and H-cores. We omit the details.
Without considering the individual rationality, we can similarly define the pre-core and pre-H-core based on the pre-imputation .
Example 4. Continued from Example 3, if , then, for each , eitheror the Hukuhara differencedoes not exists. 6. Dominance Cores of Cooperative Game with Interval-Valued Payoffs
Let be a cooperative game with interval-valued payoff. We are going to define many types of dominance core and H-dominance core.
For
and
, we say that
-dominates via coalition S if and only if
for each
and
We simply say that -dominates if and only if there is a coalition S such that -dominates via S. The -dominance core of , denoted by , is the set of imputation that are -nondominated.
For
and
, we say that
-H-dominates via coalition S if and only if
for each
and
We simply say that -H-dominates if and only if there is a coalition S such that -H-dominates via S. The -H-dominance core of , denoted by , is the set of imputation that are -H-nondominated.
For
and
, we say that
-H-dominates via coalition S if and only if
for each
, and there exist
such that
and the Hukuhara difference
We simply say that -H-dominates if and only if there is a coalition S such that -H-dominates via S. The -H-dominance core of , denoted by , is the set of imputation that are -H-nondominated.
Based on the different binary relations, we can similarly define the other types of dominance cores and H-dominance cores. For example, it is clear to see that is the set of imputation that are -nondominated, and is the set of imputation that are -H-nondominated. Using Remarks 3 and 4, we can obtain many inclusions regarding the different types of dominance cores and H-dominance cores. We omit the details.
Without considering the individual rationality, we can similarly define the dominance pre-core and H-dominance pre-core based on the pre-imputation .
Example 5. Continued from Example 3, for and , we see that -H-dominates via coalition S if and only if for each andand the Hukuhara difference 7. The Relations between Cores and Dominance Cores
We are going to investigate the inclusions and equalities between cores (resp. H-cores) and dominance cores (resp. H-dominance cores).
Proposition 3. Given a cooperative game with interval-valued payoff , under the set of imputation , we have the following inclusions:
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
Proof. We first prove the inclusion . The inclusion is obvious when .
Therefore we assume . For , there exists such that -dominates .
By definition, there exists
satisfying
for each
and
Therefore we obtain
which says that
by Remark 5, i.e.,
We can similarly obtain the inclusion . The other types of inclusions can be similarly obtained by Proposition 2 and Remark 5. This completes the proof. □
Proposition 4. Given a cooperative game with interval-valued payoff , under the set of imputation , we have the following inclusions:
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
Proof. We first prove the inclusion
. The inclusion is obvious when
. Therefore we assume
. For
, there exists
such that
-H-dominates
. By definition, there exists
satisfying
for each
,
Therefore we obtain
which says that
by Proposition 2, i.e.,
The other types of inclusions can be similarly obtained by Proposition 2 and Remark 5. This completes the proof. □
The inclusions in Propositions 3 and 4 are under the set of imputation . We can obtain the similar inclusions under the different sets of imputation. We omit the details.
Theorem 1. Let be a cooperative game with an interval-valued payoff. Suppose thatfor each with . Then Proof. For proving the inclusion
, we want to show that
For
, by the definition of anti-core, there exists
such that
, i.e.,
for some
. Let
Since
, i.e.,
, it follows that
. Using part (ii) of Proposition 1, we obtain
We are going to find an imputation such that -dominates via S.
Suppose that
, i.e.,
, we define
Then, according to (
2), we have
which says that
for some
. We also have
Then, from (
3)–(
5), we obtain
which says that
by the fact of
. Since
and
, we have
which also implies
, i.e.,
for
. Let
From (
1), we see that
, which says that
for
. From (
3), we also have
This shows that and -dominates via S.
Suppose that
, for each
, we define
We can similarly show that and -dominates via N.
Therefore we conclude that , which proves .
We can similarly obtain the inclusion using the above argument without considering and . This completes the proof. □
Suppose that the cooperative game
with interval-valued payoff is ≿-superadditive. Then we have
for each
with
.
Theorem 2. Let be a cooperative game with an interval-valued payoff. Suppose thatfor each with . Then Proof. For proving the inclusion
, we want to show that
For
, by the definition of anti-core, there exists
such that
and the Hukuhara difference
By the definition of Hukuhara difference, we see that
Therefore, from (
7), we obtain
with
or
. We also have
We are going to find an imputation such that -H-dominates via S.
Suppose that
, i.e.,
, we define
Then, according to (
9), we have
Then, from (
10)–(
12), we obtain
which says that
by the fact of
.
Since
and
with
or
, we have
which also implies
, i.e.,
for
. From (
6), we see that
for
.
Since the Hukuhara difference in (
8) exists, it says that
and
-H-dominates
via
S.
Suppose that
, for each
, we define
We can similarly show that and -H-dominates via N. Therefore we conclude that , which proves .
Using Proposition 4, we obtain the desired equality.
We can similarly obtain the inclusion using the above argument without considering and . Using Proposition 4 again, we obtain the desired equality. This completes the proof. □
Theorem 3. Let be a cooperative game with an interval-valued payoff. Suppose thatfor each with . Then Proof. For proving the inclusion
, we want to show that
For
, by the definition of anti-core, there exists
such that
, i.e.,
for some
. Let
Using Proposition 1, we have
From (
14), it follows that
. We are going to find an imputation
such that
- dominates
via
S.
Suppose that
, i.e.,
, we define
Then, according to (
15), we have
which says that
for some
. We also have
Then, from (
16), (
17) and (
18), we obtain
which says that
by the fact of
.
Since
and
, we have
which also implies
for
. From (
13), we see that
for
.
From (
16), we also have
This shows that
and
-dominates
via
S.
Suppose that
, for each
, we define
We can similarly show that and -dominates via N. Therefore we conclude that , which proves .
Using Proposition 3, we obtain the desired equality.
We can similarly obtain the inclusion using the above argument without considering and . Using Proposition 3 again, we obtain the desired equality. This completes the proof. □
Based on the different binary relations, we can similarly establish the other types of dominance cores (resp. H-dominance cores) that is contained in the cores (resp. H-cores) like Theorem 1, or the other types of dominance cores (resp. H-dominance cores) that is equal to the cores (resp. H-cores) like Theorems 2 and 3.
We omit the details.
Example 6. Continued from Examples 4 and 5, let Suppose thatfor all . Then we can show that Using the above theorems, we have the following results:
and ;
and ;
and .
8. The Relations between Pre-Cores and Dominance Pre-Cores
Now we study the relations between pre-cores (resp. H-pre-cores) and dominance pre-cores (resp. H-dominance pre-cores). We shall see that the extra inequalities are not needed. Therefore the proofs are different.
Proposition 5. Given a cooperative game with an interval-valued payoff , under the set of imputation , we have the following inclusions:
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
Proof. Since the individual rationality is not considered in for , it is clear that the proof of Proposition 3 is still valid. This completes the proof. □
Proposition 6. Given a cooperative game with interval-valued payoff , under the set of imputation , we have the following inclusions:
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
and ;
Proof. Since the individual rationality is not considered in for , it is clear that the proof of Proposition 4 is still valid. This completes the proof. □
The inclusions in Propositions 5 and 6 are under the set of imputation . We can obtain the similar inclusions under the different sets of imputation. We omit the details.
Theorem 4. Let be a cooperative game with an interval-valued payoff. Then Proof. For proving the inclusion
, we want to show that
For
, by the definition of anti-pre-core, there exists
such that
, i.e.,
for some
. Let
Since
, it follows that
. Using part (ii) of Proposition 1, we obtain
We are going to find a pre-imputation such that -dominates via S.
Suppose that
, i.e.,
, we define
Then, according to (
19), we have
which says that
for some
. We also have
Let .
Then, from (
20) and (
21), we obtain
which says that
by the fact of
.
Since
, we have
This shows that and -dominates via S.
Suppose that
, for each
, we define
We can similarly show that and -dominates via N.
Therefore we conclude that , which proves .
We can similarly obtain the inclusion using the above argument without considering and . This completes the proof. □
Theorem 5. Let be a cooperative game with an interval-valued payoff. Then Proof. For proving the inclusion
, we want to show that
For
, by the definition of anti-pre-core, there exists
such that
and the Hukuhara difference
By the definition of Hukuhara difference, we see that
Therefore, from (
22), we obtain
with
or
. We also have
We are going to find an imputation such that -H-dominates via S.
Suppose that
, i.e.,
, we define
Then, according to (
24), we have
Let .
Then, from (
25) and (
26), we obtain
which says that
by the fact of
.
Since
and
with
or
, we have
Since the Hukuhara difference in (
23) exists, it says that
and
-H- dominates
via
S.
Suppose that
, for each
, we define
We can similarly show that and -H-dominates via N. Therefore we conclude that , which proves .
Using Proposition 6, we obtain the desired equality.
We can similarly obtain the inclusion using the above argument without considering and . Using Proposition 6 again, we obtain the desired equality. This completes the proof. □
Theorem 6. Let be a cooperative game with an interval-valued payoff. Then Proof. For proving the inclusion
, we want to show that
For
, by the definition of anti-pre-core, there exists
such that
, i.e.,
for some
. Let
Using Proposition 1, we have
From (
27), it follows that
. We are going to find an imputation
such that
- dominates
via
S.
Suppose that
, i.e.,
, we define
Then, according to (
28), we have
which says that
for some
. We also have
Let .
Then, from (
29) and (
30), we obtain
which says that
by the fact of
.
Since
and
, we have
This shows that and -dominates via S.
Suppose that
, for each
, we define
We can similarly show that and -dominates via N. Therefore we conclude that , which proves .
Using Proposition 5, we obtain the desired equality.
We can similarly obtain the inclusion using the above argument without considering and . Using Proposition 5 again, we obtain the desired equality. This completes the proof. □
Based on the different binary relations, we can similarly establish the other types of relationships between the pre-cores (resp. H-pre-cores) and dominance pre-cores (resp. H-dominance pre-cores). We omit the details.
Example 7. Continued from Examples 4 and 5, using the above theorems, we immediately have the following results:
and ;
and ;
and .
9. Conclusions
In this paper, we consider the cooperative game with interval payoffs. Since the payoffs are assumed to be closed and bounded intervals in
, the comparison between any two closed intervals are needed. Therefore many kinds of orderings and strict orderings are proposed. From Definitions 2–5, six orderings are proposed as follows
and eight strict orderings are proposed as follows
In order to study the cores and dominance cores, based on the orderings in (
31), six sets of imputation
and six sets of pre-imputation
are proposed. Under these different sets of imputation and pre-imputation, we define many kinds of anti-cores and pre-anti-cores
respectively, where
is an ordering and
is a strict ordering given by
Then the cores and pre-cores are defined to be the complement sets of anti-cores and pre-anti-cores, respectively, under the sets of imputations; that is, we have
We also consider the solution concepts of dominance cores
and pre-dominance cores
where
Since the difference of any two closed intervals is not in a natural sense, the Hukuhara difference is considered, which leads to the different solution concepts of H-cores , H-pre-cores , H-dominance cores and H-dominance pre-cores . The purpose of this paper is to establish the inclusion and equality relations between the cores and dominance core by referring to Theorems 1–3, and between the pre-cores and dominance pre-core by referring to Theorems 4–6.