Quasi-Owen Value for Games on Augmenting Systems with a Coalition Structure

. This paper focuses on games on augmenting systems with a coalition structure that can be seen as an extension of games with a coalition structure and games on augmenting systems. Considering the player payoﬀs, the quasi-Owen value is deﬁned. To show the rationality of this payoﬀ index, ﬁve representative axiomatic systems are established. The population monotonic allocation scheme (PMAS) and the core are introduced. Moreover, the relationships between the PMAS and quasi-Owen value as well as the core and quasi-Owen value are discussed. Finally, an illustrative example is given to show the concrete application of the new payoﬀ indices.


Introduction
In some cooperative situations, the players join in coalitions that form a partition or coalitional structure of the set of players to get more payoffs or to gain the competitive advantage.Aumann and Dreze (1974) first established a model of games with a coalition structure, where the coalitions are independent with each other.Different from the cooperative model in reference (Aumann and Dreze, 1974;Owen, 1977) introduced games with a coalitional structure where the probability of cooperation among coalitions is considered and defined the Owen value for this type of games, which is an extension of the Shapley value (Peleg, 1986).Following the idea of the Banzhaf value, Owen (1978) further proposed the Banzhaf-Owen value for games with a coalitional structure.Later, Alonso-Meijde and Fiestras-Janeiro (2002) noted that the Banzhaf-Owen value dissatisfies the symmetry in quotient games and gave another solution concept for games with a coalition structure, which is known as the symmetric Banzhaf value.Meanwhile, the axiomatic systems of the Owen value are studied in references (Hart and Kurz, 1983;Peleg, 1989;Hamiache, 1999;Khmelnitskaya and Yanovskaya, 2007;Albizuri, 2008;Lorenzo-Freire, 2019;Hu, 2021), and the axiomatic characterizations of the Banzhaf-Owen coalition value are discussed in the literature (Amer et al., 2002;Alonso-Meijide et al., 2007;Lorenzo-Freire, 2017).
Different from games with a coalitional structure (Aumann and Dreze, 1974;Owen, 1977), due to political, economic and/or other reasons, not all coalitions can be formed in some cooperation.People usually call such games as games under precedence constraints.Myerson (1977) first considered this situation and introduced games with communication structures using graph theory.Then, the Shapley value for this type of games is researched.Faigle and Kern (1992) discussed a special type of games under precedence constraints that satisfies the offered order relationship and closes under union and intersection and discussed the axiomatic system of the given Shapley value using hierarchical strength.Following the work of Edelman and Jamison (1985), Bilbao (1998) introduced games on convex geometries.Further, Bilbao (1998) and Bilbao and Edelman (2000) studied the characterizations of the Shapley value for games on convex geometries using chain axiom and hierarchical strength, respectively.Bilbao et al. (1998Bilbao et al. ( , 1999) ) researched the Banzhaf value and the core of games on convex geometries.Later, Bilbao et al. (2001Bilbao et al. ( , 2002) ) discussed another special kind of games under precedence constraints, which is named as games on matroids.Considering the player payoffs, the authors researched the Shapley value for two cases of games on matroids.Algaba et al. (2003) presented games on antimatroids and researched the Shapley value for this kind of games.Recently, Bilbao (2003) proposed the concept of games on augmenting systems and discussed the relationship between augmenting system, antimatroid and convex geometry.Then, the author introduced the Shapley value and the Banzhaf value for games on augmenting systems.Further, Bilbao and Ordonez (2009) researched two axiomatic systems of the Shapley value for games on augmenting systems using hierarchical strength and chain axiom.Algaba et al. (2010) proposed the α value for games on augmenting systems by generalizing the Myerson value for graph games and the Shapley value for games with permission structures.Wang et al. (2022) provided a new axiomatization of the α value for games on augmenting systems in view of marginality.In addition, Meng et al. (2023) studied the profit allocation on a four-echelon supply chain from the perspective of cooperative games on augmenting systems.
In general, games with a coalition structure are formed by the players' internal factor for obtaining more payoffs, while games under precedence constraints are due to the external factor as listed above.Considering these two aspects simultaneously, Meng and Zhang (2012) introduced games on convex geometries with a coalition structure, where all feasible coalitions in each union and in the coalition structure both form a convex geometry.After that, Meng and Zhang (2012) and Meng et al. (2015) studied three payoff indices for this type of cooperative games.However, as Meng et al. (2015) noted the application of convex geometries has limitations.Recently, Meng et al. (2016) introduced games on augmenting systems with a coalition structure, where all subsets of the coalition structure and those of each union both form an augmenting system.Then, the authors defined the augmenting symmetric Banzhaf coalitional value that is used as the payoff index of the players.However, this payoff index does not satisfy the efficiency, which is one of the most important properties of indices.To address this issue, this paper defines another payoff index for games on augmenting systems with a coalition structure: the quasi-Owen value, which can be seen as an extension of the Owen value (Owen, 1977).Then, we build five axiomatic systems to show its rationality.The first two axiomatic systems are based on linearity, the third one uses strong monotonicity, the fourth one employs the potential function, and the last one adopts the balanced contributions.Then, the concepts of the population monotonic allocation scheme (PMAS) and the core of games on augmenting systems with a coalition structure are introduced.Further, the relationship between the quasi-Owen value and the core is discussed, and the sufficient conditions for the quasi-Owen value to be a PMAS are provided.
The rest of this paper is organized as follows: In Section 2, some notations and basic definitions that will be used in the following sections are reviewed.In Section 3, the concept of games on augmenting systems with a coalition structure is introduced, and the quasi-Owen value is defined.Meanwhile, five axiomatic systems are built, each of which can be used to prove the existence and uniqueness of the quasi-Owen value.In Section 4, the core and the PMAS for games on augmenting systems with a coalition structure are introduced, and the relationships between them and the quasi-Owen value are studied.In Section 5, a numerical example is provided to concretely illustrate the application of the new indices.The conclusion is made in the last section.

Some Basic Concepts
Let N = {1, 2, . . ., n} be the finite player set.The cardinality of any coalition S ⊆ N is denoted by the corresponding lower case s.As we know, the coalitional values of a cooperative game can be seen as a fuzzy measure, and the unique proofs of some payoff functions are based on the Möbius transformation.Thus, let us first review the expression of fuzzy measures using the Möbius transformation.
Let f : {0, 1} n → be a pseudo-Boolean function.Grabisch (1997) noted that any fuzzy measure μ can be seen as a particular case of the pseudo-Boolean function and put under a multilinear polynomial with n variables: where a T ∈ , y = (y 1 , y 2 , . . ., y n ) ∈ {0, 1} n , and The set of coefficients a T with T ⊆ N corresponds to the Möbius transformation, denoted by a T = S⊆T (−1) |T \S| μ(S).Because the transformation is inversible, μ can be recovered from a T by μ(A) = B⊆A a B .
Let L(N, ) = S S = l∈R⊆M\{k} B l ∪ T , ∀T ⊆ B k , ∀k ∈ M .A game with a coalition structure is a set function v : L(N, ) → + such that v(∅) = 0.By G(N, ), we denote the set of all games with a coalition structure.The restriction of to S is | S = {T ∈ L(N, ) : T ⊆ S} for any S ∈ L(N, ).In order to denote simply, we will omit braces for singleton, e.g.writing ∅, i, k instead of {∅}, {i} and {k} for any {i} ⊆ N and any {k} ⊆ M .
Let v ∈ G(N, ), Owen (1977) defined the following Owen value: where Q = l∈R B l , m and r denote the cardinalities of M and R, respectively.
said to be a quotient game on (N, ), where and M as given above, denoted by (M, v B ).

Games on Augmenting Systems
A set system on N is a pair of (N, F ), where F ⊆ 2 N is a family of subsets.
Definition 2 (Bilbao, 2003).An augmenting system is a set system (N, F ) with the following properties: It is noteworthy that when A2 is defined as: if S, T ∈ F , then S ∩ T ∈ F .(N, F ) is a convex geometry system (Bilbao, 2003).Further, when we delete the condition S ∩T = ∅ in A2, then (N, F ) is an antimatroid system (Bilbao, 2003).
Because the power set of N is an augmenting system, traditional games are also games on augmenting systems.When N = S∈F S, then the augmenting system (N, F ) is normal.Bilbao and Ordonez (2009) introduced the following concepts: A compatible ordering of an augmenting system (N, F ), as the total ordering of N , is given by i 1 < i 2 < • • • < i n such that {i 1 , i 2 , . . ., i j } ∈ F for all j = 1, 2, . . ., n.A compatible ordering of (N, F ) corresponds to a maximal chain in F .The set of all maximal chains in F is denoted by Ch(F ).Given an element i ∈ N and a compatible ordering C ∈ Ch(F ), let C(i) be the maximal chain C with i being the last element.For a set S ∈ F , let S * = {i ∈ N \S : Similar to Faigle and Kern (1992), Bilbao and Ordonez (2009) introduced the Shapley value for games on augmenting systems as: where the set function v : (N, F ) → + is a game on augmenting systems such that and c(N) = c(∅, N) are the numbers of maximal chains from ∅ to S and from ∅ to N , respectively, and c(S ∪ i, N) is the number of maximal chains from S ∪ i to N .

Games on Augmenting Systems with a Coalition Structure
In this section, we discuss cooperative games on augmenting systems with a coalition structure, which can be seen as an extension of games with a coalition structure (Owen, 1977(Owen, , 1978) ) and games on convex geometries with a coalition structure (Meng and Zhang, 2012;Meng et al., 2015).

The Concept of Games on Augmenting Systems with a Coalition Structure
Similar to the concept of augmenting system on N, Meng et al. (2016) gave the concept of augmenting systems on M = {1, 2, . . ., m} for = {B 1 , B 2 , . . ., B m }, namely, an augmenting system on M is a set system (M, F M ) with the following properties: The number of maximal chains from R to K is denoted by c(R, K), and c(R) is the number of maximal chains from ∅ to R.
From Definition 2, one can check when the domain of N is restricted to B k , we get an augmenting system (B k , F B k ), where F B k ⊆ 2 B k is a family of subsets that satisfies the conditions given in Definition 2. Augmenting systems with a coalition structure mean that the subsets of M = {1, 2, . . ., m} and those of each B k ∈ (k ∈ M) form an augmenting system, respectively, denoted by (N, , F ). Let with R * = {k ∈ M\R : R ∪ k ∈ F M }, which denotes the set of formed coalitions.
Definition 3. A game on augmenting system with a coalition structure is a set function Let G(N, , F ) be the set of all games on augmenting systems with a coalition structure.Without special explanation, for any (N, , F ), we always assume B k ∈ F B k for any k ∈ M and M ∈ F M , namely, the augment systems on each union and on the coalition structure are normal.
For (N, , F ) with N ∈ F , following the works of Faigle and Kern (1992) and Bilbao and Ordonez (2009), Meng et al. (2016) defined the hierarchical strength h B k S (i) of i ∈ S for the coalition S ∈ F B k as follows: where Ch(F B k ) is the set of all maximal chains in is the average number of maximal chains in which the player i ∈ S is the last member of S in the chain (Bilbao and Ordonez, 2009).
Similarly, we define the hierarchical strength where Example 1.Let N = {1, 2, 3, 4, 5}, and = {B 1 , B 2 } be a coalition structure on N , where B 1 = {1, 2, 3} and , M}, then it is an augmenting system with a coalition structure, where Because v is defined on L(N, , F ), the value v(S ∩ T ) can be any real number for S ∩ T / ∈ L(N, , F ).In this case, we assume that v(S ∩ T ) = v(S) for defining the concept of carrier.For instance, in Example 1, if T = {1, 2} and S = {2, 3}, then In this case, we consider v(2) = v(2, 3), where v(2) is not real existence for {2} being a virtual coalition.Note that when in the above case, we adopt this process.

The Quasi-Owen Value
Similar to Owen (1977) and Bilbao and Ordonez (2009), the quasi-Owen value for games on augmenting systems with a coalition structure is expressed as: where When there is only one union in M, then the quasi-Owen value degenerates to the Shapley value for games on augmenting systems.When we restrict the domain of (N, , F ) in the setting of (N, ), then the quasi-Owen value degenerates to the Owen value.In summary, the quasi-Owen value is an extension of the Owen value, which is used for games on augmenting systems with a coalition structure.
For any T ∈ L(N, , F )\∅, we define the unanimity game u T as Lemma 1 (Meng et al., 2016).Let v ∈ G(N, , F ), then there is a unique set of coefficients {c T : where r and h denote the cardinalities of R and H , respectively.
Let f be a solution on G(N, , F ).To show the axiomatic systems of the augmenting symmetric Banzhaf coalitional value, Meng et al. (2016) introduced the following two properties: Similar to the axiomatizations of the Owen value (Owen, 1977) and the Shapley value for games on augmenting systems (Bilbao and Ordonez, 2009), we introduce the following two properties: where Remark 1.If there is only one coalition in , then hierarchical strength in coalitions degenerates to hierarchical strength for games on augmenting system.If all subsets of M and those of each B k ∈ are both feasible, then hierarchical strength in coalitions and hierarchical strength on unions degenerate to symmetry in the unions and symmetry in the quotient games for games with a coalition structure, respectively.It is noteworthy that hierarchical strength on unions defined in Meng et al. (2016) is different from the above one.
Next, we apply the above listed axioms to show the existence and uniqueness of the quasi-Owen value.First, let us consider the following lemma: Then, the quasi-Owen value defined on the unanimity game u T can be expressed as: where T = S l∈R∈F M ,k∈R * B l and S ∈ F B k \∅.
Proof.From the expression of the quasi-Owen value, we have and where We get The result is obtained.
Theorem 1.There is a unique solution f defined on G(N, , F ) that satisfies L, EFF-1, HSC and HSU.
From Lemma 2, we get HSC.Further, according to Lemma 2 we have and From EFF-1, we obtain and Thus, HSU holds.Uniqueness.From Lemma 1 and L, we only need to prove the uniqueness of Eq. ( 7) on u T for any T on as follows: where R ⊆ M.
Let f be a solution on (N, , u T , F ) that satisfies the above axioms.From EFF-1 and HSU, we have For any k ∈ M , from HSC we get According to Lemma 2, we know that f and ϕ coincide on u T .
Similar to Bilbao and Ordonez (2009), we define the identify game for G(N, , F ) to research another axiomatization of the quasi-Shapley value.For any S ∈ L(N, , F )\∅, the identify game δ S : L(N, , F ) → is defined as: Using the identify game, we offer the following axiom which is an extension of Chain axiom for games on augmenting systems (Bilbao and Ordonez, 2009).
• Chain axiom in coalitions (CAC).Let v ∈ G(N, , F ).For any T ∈ L(N, , F ), without loss of generality, suppose that T = S l∈R∈F M ,k∈R * B l , where S ∈ F B k \∅.
Then, for all i, j ∈ exS, we have From Eq. ( 7), one can easily check that the quasi-Owen value can be equivalently expressed as: where Theorem 2. There is a unique solution f defined on G(N, , F ) that satisfies L, EFF-1, CAC and HSU.
Proof.From u S = S⊆T δ T for any S ∈ L(N, , F )\∅ and Theorem 1, one can easily derive the conclusion.
Next, let us consider another axiomatization of the quasi-Owen value.Young (1985) proposed a characterization of the Shapley value using strong monotonicity.According to Young (1985), we propose strong monotonicity in the framework of games on augmenting systems with a coalition structure.
Theorem 3.There is a unique solution f defined on G(N, , F ) that satisfies EFF-1, HSC, HSU and SM.
Proof.From Theorem 1 and Eq. ( 7), it is easy to conclude that ϕ satisfies these properties.
Next, let us consider the uniqueness.From Lemma 1, for any v ∈ G(N, , F ) it can be uniquely expressed as: Let I be the minimum number of non-zero terms in some expression for v in (5).As in Young (1985), the theorem is proved using induction on I .
EFF-1, HSC and HSU, we derive where M and B as shown in Theorem 1. (III) Assume that f is unique whenever the index of v is at most I .Let v have the index I + 1 with the following expression: where T r ∈ L(N, , F )\∅ such that c T r = 0.
Let T = I +1 r=1 T r , for any i ∈ N \T we construct the game Then, the index of w is at most for all S ∈ L(N, , F ) with i ∈ S * and i ∈ N \T .According to induction and SM, we have where On the other hand, for any i ∈ T , by EFF-1, HSC and HSU we obtain The conclusion is obtained.
Next, we will give another two axiomatic systems to characterize the quasi-Owen value from the perspective of the potential function and balanced contributions, respectively.
Hart and Mas-Colell (1989) first introduced the concept of the potential function.Later, Winter (1992) extended the potential function to games with a coalition structure, by which an axiomatic system of the Owen value (Owen, 1977) was characterized.Now, we define the potential function for games on augmenting systems with a coalition structure to characterize the quasi-Owen value.
P is said to be a potential function for the game G(N, , v, F ) if it satisfies for all k ∈ M, and Using the potential function for games on augmenting systems with a coalition structure, we offer the following theorem for the quasi-Owen value.
Theorem 4.There is a unique potential function P for the game G(N, , v, F ).Moreover, for any v ∈ G(N, , F ) and any i ∈ N , where ϕ is the quasi-Owen value.
Proof.Existence.For any B k ∈ and any T ∈ L(N, , F ), let where m and b k are the cardinalities of M = {k ∈ M : B k ∩ T = ∅} and B k = B k ∩ T , k ∈ M, respectively, and c T as shown in Eq. ( 28). Let Without loss of generality, suppose that i ∈ B k for any i ∈ T , we have From Eq. ( 38) and EFF-2, P satisfies Eq. ( 36).Therefore, P is a potential function.
Uniqueness.Note that Eq. ( 35) can be written as where b k is the cardinality of B k .
When there is only one union in the coalition structure, we can conclude that there is the Hart-Mas-Colell potential function (Hart and Mas-Colell, 1989) which is known to be unique.By Eq. ( 35) and Eq. ( 36), we further derive that P defined on (M, v B , F M ) is unique.Then, we can obtain the uniqueness of P (N, , v, F ) recursively according to Eq. ( 40) with the initial condition P (∅, , v, F ) = 0.
Different to EFF-1, which is defined in view of carrier, we define the following EFF-2 which will be used in the following two axiomatic systems.
Next, we consider the last axiomatic system of the quasi-Owen value.Myerson (1980) proposed a characterization of the Myerson value using Balanced contributions.Later, Zou et al. (2020) presented the Intracoalitional quasi-balanced contributions with respect to α and Coalitional quasi-balanced contributions with respect to α to characterize the α-Egalitarian Owen value for cooperative games with a coalition structure.Now, we propose Intra-coalitional balanced contributions and Coalitional balanced contributions for games on augmenting system with a coalition structure as: • Intra-coalitional balanced contributions (IBC).Let v ∈ G(N, , F ).For any T ∈ L(N, , F ), without loss of generality, suppose that T = S l∈R∈F M ,k∈R * B l , where S ∈ F B k \∅.Then Theorem 5.There is a unique solution f defined on G(N, , F ) that satisfies EFF-2, IBC, and CBC, which equals to ϕ.
Proof.Existence.Obviously, ϕ satisfies EFF-2.From Theorem 4, we know that ϕ i (N, , v, F ) = D i P (N, , v, F ), where P is the unique potential function for the game v ∈ G(N, , F ). Therefore, for any T ∈ L(N, , F ), without loss of generality, suppose that T = S l∈R∈F M ,k∈R * B l , where S ∈ F B k \∅.Then, Thus, IBC holds.Similarly, one can show that CBC is true.
To prove uniqueness, we just need to show that f admits a potential function.Let v ∈ G(N, , F ).For any T ∈ L(N, , F ), without loss of generality, suppose that T = S l∈R B l , where S ∈ F B k and R ∈ F M \k.When t = 1 with t being the cardinality of T , by EFF-2 we have where P is the unique potential function for the game G(N, , v, F ).By induction, when t n−1 (n 2), for any i ∈ S, we have By Eq. ( 43), we derive From the definition of the potential function and Eq. ( 44), we get Next, we prove the conclusion is true when t = n.By CBC, we obtain By Eq. ( 45), we derive by which we get According to EFF-2, we derive From the concept of the potential function, we obtain By IBC, we get Then, where b k is the cardinality of B k .From Eq. ( 46), we have By Eq. ( 40), we know that the right hand side of Eq. ( 48) equals to P (N, , v, F ). Thus, Eq. ( 43) is true for t = n.Theorem 4 shows that the conclusion is obtained.
In this subsection, we focus on the axioms of the quasi-Owen value and give five axiomatic systems.These axiomatic systems can be divided into two categories in view of the axiom of linearity.The first two are based on linearity, while other three suggest alternative foundations of the quasi-Owen value without linearity.It is noteworthy that we can similarly build other axiomatic systems.

The Core and the PMASs
In this section, we introduce the core and the PMAS for games on augmenting systems with a coalition structure.Further, the relationship between the quasi-Owen value and the core is discussed, and the conditions for the quasi-Owen value to be a PMAS are given.

The Concept of the Core
In a similar way to the core of games with a coalition structure (Pulido and Sánchez-Soriano, 2009), the definition of the core of games on augmenting systems with a coalition structure is defined as: Definition 6.Let v ∈ G(N, , F ).The core C(N, , v, F ) of v is defined as: Now, we investigate some properties of the core, which are extended from reference (Pulido and Sánchez-Soriano, 2009).First, we introduce the concept of reduced games for games on augmenting systems with a coalition structure.Definition 7. Let v ∈ G(N, , F ), and let x be a corresponding solution.For any S ∈ L(N, , F ), the reduced game G(S, | S , v x S , F | S ) is defined as: where From reduced games, we further offer the following concepts of the coalitional reduced game property (C-RGP) and the coalitional converse reduced game property (C-CRGP). Otherwise, Hence, v x S (T ) x(T ).Therefore, the conclusion is true.
Next, we show that the core satisfies C-CRGP.To do this, let us consider the following lemma.
Definition 9.If for any k ∈ M and any i ∈ B k , we have k ∈ F M and i ∈ F B k , then we call (N, , F ) an atomic augmenting system with a coalition structure.
Lemma 4. Let (N, , F ) be an atomic augmenting system with a coalition structure.For any S ∈ L(N, , F )\{N, ∅} and any j ∈ N \S such that S ∪ j ∈ L(N, , F ), there is a player i ∈ S such that {i, j } ∈ L(N, , F ).
Proof.From the assumption, we have S ∪ j ∈ L(N, , F ). Since (N, , F ) is atomic, we have j ∈ L(N, , F ).Then, there is a chain from j to S ∪j .In this chain, there is a set {i, j } ∈ L(N, , F ) such that {j } ⊆ {i, j } ⊆ S ∪ j .Therefore, i ∈ S, which concludes the proof.
According to Lemma 4, we offer the following proof of C-CRGP.(N, , F ) be an atomic augmenting system with a coalition structure, and x be a solution.
Proof.If n 2, the statement obviously holds.Assume that n 3. We show that the statement still holds for all S ∈ L(N, , F ) with s = 2.
for all S ∈ L(N, , F ) with s = 2. From S ∈ L(N, , F )\{N, ∅} and Lemma 4, we know that there are two players i ∈ S and j ∈ N \S such that {i, j } ∈ L(N, , F ). Since (N, , F ) is atomic and

Therefore, v(S) x(S).
The following corollary is immediate from Lemma 5, which shows that the core of v ∈ G(N, , F ) satisfies the C-CRGP when (N, , F ) is atomic.and (N, , F ) be an atomic augmenting system with a coalition structure.Then, the core C(N, , v, F ) satisfies C-CRGP.
To build the axiomatic system of the core C(N, , v, F ), we further review the property of the individual rationality (IR): Let v ∈ G(N, , F ) and x be a solution.If x i v(i) for any i ∈ L(N, , F ), then the solution x owns IR.
From the above analysis, one can check that the core of games on atomic augmenting systems with a coalition structure satisfies: EFF-2, I R, C-RGP and C-CRGP.In fact, these four properties can characterize the core of games on atomic augmenting systems with a coalition structure., , F ) is an atomic augmenting system with a coalition structure, then the core C(N, , v, F ) is the unique solution on v that satisfies EFF-2, I R, C-RGP and C-CRGP.
Proof.The proof of Theorem 6 is similar to that of Theorem 5.14 in Peleg (1986), hence it is omitted.Remark 2. If there is only one coalition in , then C-RGP and C-CRGP degenerate to the reduced game property (RGP) and the converse reduced game property (CRGP) for games on augmenting system, respectively.If all subsets of M and those of each B k ∈ are both feasible, then C-RGP and C-CRGP degenerate to the corresponding properties for traditional games with a coalition structure, respectively.Similar to the Owen value for games with a coalition structure, we can prove that the quasi-Owen value for games on augmenting systems with a coalition structure belongs to the core.Based on the work of Pulido and Sánchez-Soriano (2009), we first give the following definition of quasi coalitional strong-convex games.
Following the work of Pulido and Sánchez-Soriano (2009), one can conclude that the quasi Owen value belongs to the core of quasi coalitional strong-convex games.However, as the next example shows, even if the game v ∈ G(N, v, , F ) is not quasi coalitional strong-convex, the quasi Owen value may still belong to the core.
for any S, T ∈ F B k such that S ⊆ T .
According to Definition 11, one can easily check that the game offered in Example 2 is a quasi-chain coalitional convex.By Definitions 10 and 11, one can conclude that quasi coalitional strong-convex game is quasi-chain coalitional convex game.Similar to classical case, we derive the following theorem.
Proof.For any S ∈ L(N, , F ), without loss of generality, suppose that S = T ∪ k l ∈H B k l , where T ∈ F B kp , H ∈ F M , and k p ∈ H * .Then, there is a compatible ordering from ∅ to H ∪ k p and a compatible ordering from ∅ to T .Assume that {∅, {k 1 }, {k 1 , k 2 }, . . ., H, H ∪ k p , H ∪ k p ∪ k q , . . ., M} ∈ Ch(M) and ∅, {i It is obvious that i∈N x i = v(N).
1 , where i k q 1 ∈ F B kq .Since k q ∈ (H ∪ k p ) * , by the quasi-chain coalitional chain convexity of v, we get By recursive relation, we get i∈S x i −v(S) i∈N x i −v(N) = 0. Thus, (x i ) i∈N ∈ C(N, v, , F ). From Eq. ( 7), we know that (ϕ i (N, , v The above theorem shows that when games on augmenting systems with a coalition structure are convex, there is no player who can make his own payoff larger than the quasi-Owen value without reducing other players' payoff.Hence, there are no incentive to deviate from this allocation scheme.

The Concept of PMASs
Inspired by Sprumont (1990) who first introduced and studied the concept of PMASs for traditional cooperative games, we here introduce the notion of PMASs for games on augmenting systems with a coalition structure.Definition 12. Let v ∈ G(N, , F ).If the vector x = (x i (S)) i∈S satisfies (i) i∈S x i (S) = v(S) for any S ∈ L(N, , F ); (ii) x i (S) x i (T ) for all i ∈ S and all S, T ∈ L(N, , F ) such that S ⊆ T ; then x = (x i (S)) i∈S is called a PMAS.
Next, we study the conditions under which the quasi-Owen value is a PMAS.
Proof.From Eq. ( 7), one can easily derive the condition (i) in Definition 12.As for the condition (ii), it is proved recursively.Suppose that S ∪j = T , where j / ∈ S. From Eq. ( 7), we have for any i ∈ S. By condition (ii), we have By the property A2, we have i ∈ (A ∪ j) * for any i ∈ A * .Then, Eq. ( 55) can be written as: According to the condition (iii) we obtain By condition (ii), we have According to Eqs. ( 54), ( 56) to (58), we derive Case 2. T = D l∈Q∈F M ,k∈Q * B l , where Q = R ∪ h and B h = {j }.From Eq. ( 7), we have for any i ∈ S, where W = l∈U ∈ F M R∪h B l .By condition (i), we obtain By the property A2, we have k ∈ (U ∪ h) * for any k ∈ U * .Then, Eq. ( 59) can be written as: By conditions (i) and (iii), we have ϕ i (S, | S , v| S , F S ) ϕ i (T , | T , v| T , F | T ) for all i ∈ S. Hence, (ϕ i (N, , v, F )) i∈N is a PMAS.Remark 3. If there is only one coalition in , get the conditions for the Shapley value for games on augmenting systems to be a PMAS.If all subsets of M and those of each B k ∈ are feasible, the three conditions in Theorem 8 reduce to the condition for the Owen value for games with a coalition structure to be a PMAS.

An Illustrative Example
In this section, we provide an application of games on augmenting system with a coalition structure in the food supply chain.Set up a supply chain consisting of food raw material supplier, food packaging supplier, food processing manufacturer, wholesaler and retailer.For the convenience of expression, the above members are set as 1, 2, 3, 4 and 5, respectively.The model of the food supply chain is shown in Fig. 1.
One can easily check that (ϕ i (N, , v, F )) i∈N ∈ C (N, , v, F ).It shows that no enterprise can make its own payoff greater than the quasi-Owen value without reducing other players' payoffs.Namely, the quasi-Owen value is one of the best rule to distribute the coalition payoffs of the companies in the food supply chain.This example shows that L(N, , F ) = {∅, {1}, {2}, {1, 3}, {2, 3}, {1, 2, 3}, {1, 2, 3, 4}, {1, 2, 3, 4, 5}}.For all S, T ∈ L(N, , F ), such that S ⊆ T , one can check that the conditions in Theorem 8 are satisfied.Further, one can show that the quasi-Owen value is a PMAS.For example, when S = {1, 3} and T = {1, 2, 3}, we have From the above results, we know that each enterprise can get more payoffs from the larger coalitions than from the smaller coalitions.

Conclusion
From the relationships among augmenting system, antimatroid and convex geometry (Bilbao and Ordonez, 2009), one can easily check that when augmenting systems on a coalition structure and on each union are closed under intersection, they turn to games on convex geometries with a coalition structure.Further, when augmenting systems on a coalition structure and on each union are closed under union, they become games on antimatroids with a coalition structure.It is noteworthy that the power set is also an augmenting system.Thus, game on augmenting systems with a coalition structure is an extension of game with a coalition structure.
The above relationships about different types of games show that the quasi-Owen value can be seen as a payoff index for them under the corresponding special conditions.Further, all listed axiomatic systems still hold for the quasi-Owen value in the setting of the above mentioned cooperative games, where axiomatic systems are defined under the associated conditions.This paper only studies a special kind of games under precedence constraints with a coalition structure, and it will be interesting to take into account other types of games under precedence constraints.Moreover, similar to the offered numerical example, we can apply the quasi-Owen value into other practical cooperative cases.

Definition 8 .
Let v ∈ G(N, , F ), S ∈ L(N, , F )\∅ and σ be a solution.If x ∈ σ (N, , v, F ) implies x| S ∈ σ (S, | S , v x S , F | S ), then the solution σ satisfies C-RGP.Further, if x| S ∈ σ (S, | S , v x S , F | S ) means x ∈ σ (N, , v, F ), then the solution σ satisfies C-CRGP, where x| S denotes the restriction of x to the coalition S.
the quasi-chain coalitional chain convexity of v, we get i∈S x i − v(

Theorem 8 .
Let v ∈ G(N, , F ), and S, T ∈ L(N, , F ) with S ⊆ T .Without loss of generality, suppose that S = D l∈R∈F M ,k∈R * B l and T ) for any i ∈ S, where W = l∈U ∈ F M R∪k B l .Case 1. T = Y l∈R∈F M ,k∈R * B l , where Y ∈ F B k and Y = D ∪ j .Then,

Fig. 1 .
Fig. 1.The model of the food supply chain.

J.
Tang received the MS degree from Qingdao Technological University in 2008 and the PhD degree from Central South University in 2020.Currently, she is an associated professor in Nanjing University of Information Science and Technology Nanjing.Her research interests include game theory, decision making and preference relation.At present, she has published more than 30 papers.Z. Li is carrying out her PhD degree in School of Business, Central South University.She received his master degree in Chongqing University in 2016.Her research interests include fuzzy game, stochastic game and decision making.At present, she has published 3 papers.F. Meng received the MS degree from Guangxi University in 2008 and the PhD degree from Beijing Institute of Technology, China in 2011.From 2014 to 2016, he was a Post-Doctoral Researcher with the School of Business, Central South University.Currently, he is a professor in Nanjing University of Information Science & Technology, and Central South University.His research interests include fuzzy mathematics, decision making and game theory.At present, he has published more than 150 papers.

Table 1
The coalition values (million dollars/week).