Characterizations, Potential, and an Implementation of the Shapley-Solidarity Value

: In this paper, we provide cooperative and non-cooperative interpretations of the Shapley–Solidarity value for cooperative games with coalition structure. Firstly, we present two new characterizations of this value based on intracoalitional quasi-balanced contributions property. Secondly, we study a potential function of the Shapley–Solidarity value. Finally, we propose a new bidding mechanism for the Solidarity value and then apply the result to the Shapley–Solidarity value.


Introduction
In economic situations, players usually form a coalition with the aim of obtaining more profits. It is an important issue to distribute the surplus of cooperation among the players. Game theory provides general mathematical techniques to analyze such distribution problems. The solution part of cooperative game theory deals with the allocation problem of how to divide the overall earnings among the players in the game. There are various solution concepts in the field of cooperative games.
Probably, the Shapley value [1] and the Solidarity value [2] are the two most well-known solutions in cooperative game theory. They have similar formula, but a different way to value players' contributions to the coalitions. The Shapley value is a marginalist value because it considers the pure marginal contribution of every player, while the Solidarity value behaves more equalitarian than the Shapley value, since it considers the average marginal contribution of every player.
Various authors have proposed many characterizations of these two solutions. Shapley [1] initially proposed an axiomatization of the Shapley value by means of efficiency, additivity, symmetry and the null player property. Among the latter ones, Young's axiomatization [3] stands out by the elegance of its marginality axiom, which replaces additivity and the null player property in the initial characterization of the Shapley value. Myerson [4] proposed an axiom of the balanced contributions property in order to characterize the Shapley value. van den Brink [5] interpreted the Shapley value as the unique solution satisfying fairness, efficiency, and the null player property. Mcquillin and Sugden [6] characterized the Shapley value while using a condition of 'undominated merge-externalities'. Calleja and Llerena [7] provided an axiomatization of the Shapley value by weak self consistency, weak fairness, and the dummy player property. Recently, Alonso-Meijide et al. [8] introduced new properties by considering three special kinds of agents: null, nullifying, and necessary agents, and then obtained new characterizations of the Shapley value. van den Brink et al. [9] discussed two solutions for cooperative transferable utility games, the Shapley value and the proper Shapley value and characterized them by the property of affine invariance.
Hart and Mas-Colell [28] introduced a way of potential function to characterize the Shapley value. They defined a potential function assigning to every cooperative game a real number and proved that the marginal contribution vector of the function coincides with the Shapley value. Winter [29] extended this way of characterization to games with coalition structure where the Owen value [20], the AD value [30] were considered. Xu et al. [31] adjusted the original potential function for the Shapley value, so that they got a potential function for the Solidarity value. For the Shapley-Solidarity value, we can obtain the potential function from the potential functions of the Owen and Solidarity value.
Another approach to study a cooperative game solution is mechanism design which can be viewed as a part of the Nash program [32] to implement cooperative game solutions through non-cooperative game theory. Bidding mechanism, first introduced by Pérez-Castrillo and Wettstein [33], is used to implement the Shapley value. Vidal-Puga and Bergantiños [34] implemented the Owen value by a two-rounds coalitional bidding mechanism. Sikker [35] studied the non-cooperative foundations of network allocation rules, including several classical solutions, such as the Myerson value and the position value, which are implemented by bidding mechanism. Ju and Wettstein [36] introduced a generalized bidding approach based on the original bidding approach in Pérez-Castrillo and Wettstein. Addtitionally, the Shapley, consensus [37] and equal surplus values [38] are implemented. van den Brink et al. [39] implemented the egalitarian Shapley value based on Pérez-Castrillo and Wettstein's bidding approach. For the discounted Shapley value, van den Brink and Funaki [40] implemented it in a similar approach.
There is no present research for studying the non-cooperative implementation of the Shapley-Solidarity value. If we want to implement the Shapley-Solidarity value we should replace the first round in the coalitional bidding mechanism in Vidal-Puga and Bergantiños [34] with a mechanism that can implement the Solidarity value.
In this paper, we will study the Shapley-Solidarity value from three aspects. First of all, we give axiomatic characterizations of the Shapley-Solidarity value mainly using intracoalitional quasi-balanced contributions, which is an extended version of quasi-balanced contributions [31]. Subsequently, we obtain an adjusted potential function with respect to the Shapley-Solidarity value. At last, we give a new implementation of the Solidarity value using bidding mechanism. Additionally, we apply this result to the games with coalition structure and implement the Shapley-Solidarity value.
The paper is organized, as follows. In Section 2, we introduce some basic definitions and notations. Axiomatic characterizations of the Shapley-Solidarity value will be presented in Section 3. Subsequently, we study the potential function for the Shapley-Solidarity value in Section 4. Finally, in Section 5, we provide a non-cooperative implementation of the Shapley-Solidarity value.

Preliminaries
A cooperative game with transferable utility or simply a game is a pair (N, v) where N = {1, 2, · · · , n} is a player set and v : 2 n → R with v(∅) = 0 is a characteristic function which assigns to each coalition S ∈ 2 n the worth v(S). Denote the family of all cooperative games by G, and then denote the family of all cooperative games with player set N by A value on G N is a function ϕ that assigns a payoff vector ϕ(N, v) ∈ R n to every games (N, v) ∈ G N . The Shapley value [1], which is denoted by Sh, assigns to every player the expectation of his marginal contributions with respect to all coalitions. For any (N, v) ∈ G N and i ∈ N, where |S| is the cardinality of player set S. The Solidarity value [2] is similar to the Shapley value, but it behaves more equalitarian, which assigns to every player the expectation of his average marginal contributions with respect to all coalitions. The Solidarity value Sol(N, v) ∈ R n is defined as, for any (N, v) ∈ G N and i ∈ N, For a player set N, a coalition structure over N is a partition of N, i.e., C = {C 1 , C 2 , ..., C m }, satisfying h∈M C h = N and C h ∩ C r = ∅ when h = r, where M = {1, 2, ..., m}. The set C h ∈ C are called unions. Denote the set of all coalition structures over N by C(N). A game (N, v) with coalition structure C ∈ C(N) is denoted by (N, v, C). Denote the family of all the games with coalition structure with player set N by CG N .
For all games with coalition structure, the game defined between unions is called quotient game. Formally, for all game (N, v, C) ∈ CG N , with C = {C 1 , C 2 , ..., C m }, the quotient game is denoted by For all k ∈ M and all S ⊆ C k , denote, by C| S , the new coalition structure ( j =k C j ) S, which means that the union C k is replaced by coalition S in the original coalition structure. The internal game (C k , v k ) is defined in Owen [20] where v k (S) = Sh k (M, v C| S ).
A coalitional value f on CG N is a function assigning a vector f (N, v, C) ∈ R N to each game with coalition structure (N, v, C) ∈ CG N . The Owen value [20] of the game (N, v, C) is the coalitional value, defined as Another interesting coalitional value, called the Shapley-Solidarity value [24], was introduced and characterized by Calvo and Gutiérrez. They stuck with the Shapley value among unions and applied the Solidarity value between players within the same union. Formally, for a game (N, v, C) ∈ CG N the Shapley-Solidarity value is defined as

New Characterizations for the Shapley-Solidarity Value
Axiomatization is one of the main ways to characterize the reasonability of solutions with a set of properties in cooperative games. In this section, we characterize the Shapley-Solidarity value by introducing the intracoalitional quasi-balanced contributions property, inspired from the balanced contributions property.
The balanced contributions property, as introduced by Myerson [4], indicates that, for any pair of players, the influence of a player who leaves the grand coalition on the other player is the same as the impact of the other player's departure on it. Myerson [4] We first introduce two axioms, inspired by the balanced contributions property, and both of them are used in order to characterize the Solidarity value. In Xu et al. [31], the Solidarity value is characterized by the quasi-balanced contributions property with efficiency.
Quasi-balanced contributions (QBC): a solution ϕ on G N satisfies the quasi-balanced contributions property if for any (N, v) ∈ G N , i, j ∈ N with i = j, In Calvo and Gutiérrez [24], the Solidarity value is also characterized by the equal averaged gains property together with efficiency.
Equal averaged gains (EAG): a solution ϕ on G N satisfies the equal average gains property if for any (N, v) The previous two properties have been both used for characterizing the Solidarity value separately. However, one can easily check that these two properties are independent with each other.
Calvo et al. [41] introduced the property of intracoalitional balanced contributions to characterize the level structure value. It states that, for any two players in one union, the influence of a player who leaves the union on the other player is the same as the impact of the other player's departure on it.
Intracoalitional balanced contributions (IBC): For all (N, v, C) ∈ CG N and all i, j ∈ C h ∈ C, i = j, In Lorenzo-Freire [27], it is proved that, if a coalitional value satisfies the intracoalitional balanced contributions property, then it can be computed by means of the Shapley value. Next, we will define the intracoalitional quasi-balanced contributions property, and we will prove that if a coalitional value satisfies the intracoalitional quasi-balanced contributions property, it can be computed by means of the Solidarity value.
Intracoalitional quasi-balanced contributions (IQBC): For all (N, v, C) ∈ CG N and all i, j ∈ C h ∈ C, i = j, where the game (C h , v f ,C ) [27] is defined as for all T ⊆ C h , T = ∅. This game means that the payoff for each subset of players in the union is the sum of the payoffs of these players given by the coalitional value when the union is replaced by the subset. Obviously, this property is directly extended from the quasi-balanced contributions property.

Proposition 1.
A coalitional value f satisfies IQBC if and only if for all (N, v, C) ∈ CG N and all i ∈ C h with C h ∈ C, Proof. Given i ∈ C h , if a coalitional value f satisfies IQBC, then for all j ∈ C h \{i}, Summing over j ∈ C h \{i}, we obtain that Consider the definition of the game (C h , v f ,C ), then we have Thus, Now, it remains to proven the reverse part. The proof will be done by induction on |C h |. Suppose that C h = {i, j}, then we have Accordingly, we have By the induction hypothesis, the following result is true for all k ∈ C h \{i, j}, Thus,

Proposition 2.
A coalitional value f satisfies IQBC if and only if for all (N, v, C) ∈ CG N and all i ∈ C h with Proof. Because the Solidarity value satisfies the quasi-balanced contributions, we have that for all i, To prove the counterpart, we will use the induction on |C h |.
where t denotes the cardinality of the coalition T. Thus, we have Calvo and Gutiérrez [24] extended the equal averaged gains property to games with coalition structure and they introduced the following property.

Proposition 3.
A coalitional value f satisfies IEAG if and only if for all (N, v, C) ∈ CG N and all i ∈ C h with C h ∈ C, Proof. If the coalitional value f satisfies IEAG then for all Fixing i and summing over j ∈ C h , we have It remains to prove the counterpart, Accordingly, we have following corollaries.

Corollary 1.
A coalitional value f satisfies IQBC if and only if it satisfies IEAG.

Corollary 2. A coalitional value f satisfies IEAG if and only if for all
Now, we introduce some properties that will be used in the characterizations of the Shapley-Solidarity value.
A coalitional value f on CG N satisfies: Lorenzo-Freire [26] introduced the following proposition. Proof. Because the property of IQBC and IEAG are equivalent, we only consider IEAG in the following proof.
(a) We first check that the Shapley-Solidarity value satisfies these properties. Calvo and Gutiérrez [24] have already proved the Shapley-Solidarity value satisfies EFF and IEAG. Because the Shapley-Solidarity value satisfies quotient game property i.e., ∑ i∈C h SS i (N, v, C) = Sh h (M, v C ), and the Shapley value satisfies symmetry and strong marginality, the Shapley-Solidarity value satisfies CSY and CSM.
Next, we will prove these properties can identify the Shapley-Solidarity value uniquely. Suppose the coalitional value f satisfies EFF, IEAG, CSY, and CSM. From former propositions, we have proved that if a coalitional value f satisfies IEAG, then for all i ∈ C h and By Proposition 4, if f satisfies EFF, CSY, and CSM, then for all Thus, From the definition of the Shapley-Solidarity value (1), we have f (N, v, C) = SS i (N, v, C). (b) Because ADD and NU can imply CSM [26], the proof of this part is similar to the proof of (a), and we omit it. Lemma 1. Note that Calvo [24] characterized the Shapley-Solidarity value by EFF, IEAG and CBC, where CBC is coalitional balanced contributions property which is shown as follows.
Coalitional balanced contributions (CBC): for all (N, v, C) ∈ CG and all C i , C j ∈ C, Obviously, the CBC property is extended from the balanced contributions in Myerson [4]. It states that, for all C i , C j ∈ C, the influence of the members in C i who leave the grand coalition on C j is the same as the impact of the members's departure in C i on C j .

The Potential Function for the Shapley-Solidarity Value
Hart and Mas-Colell [28] characterized the Shapley value by means of consistency property and standard for two-person games. An interesting concept, called potential function, is used for the characterization.
A function P : G → R with P(∅, v) = 0 is called a potential function if it satisfies for any where D i P(N, v) represents the marginal contributions of a player i ∈ N with respect to the potential function, which is defined by In a similar way, Xu et al. [31] defined A i P * (N, v) = D i P(N, v) + 1 n v(N\{i}) as the adjusted marginal contribution for player i and they obtained an A-potential function. They also proved that the vector of the adjusted marginal contributions coincides with the Solidarity value.
For games with coalition structure, Winter [29] first extended the concept of potential function. Our potential function for the Shapley-Solidarity value is inspired by the potential function of the Owen value introduced in Winter [29] and use the similar way of adjustment in Xu et al. [31]. Now, we define a potential function for games with coalition structure. Definition 1. Let P be a function defined on CG s.t. P(N, v, C) ∈ R m , where C = (C 1 , C 2 , · · · , C m ) and P j (N, v, C) = 0 when C j ∩ N = ∅. The marginal contribution of player i ∈ C j to (N, v, C) is The function P is said to be an adjusted potential function for games with coalition structure if for all Denote, by [S], the coalition S ∈ C when considered as a player, and the set of players in v C by [C]. C| S\{i} is the coalition structure that player i is deleted from S. Expression (11) says that the sum of the adjusted marginal contributions of players i ∈ S ∈ C is the marginal contribution of the player [S] to the ([C], v C , [C]), where the player set is C = (C 1 , C 2 , · · · , C m ), the game is v C . So, combining with (12), P(∅, v, C) = 0 and the definition of potential function for the Shapley value in Hart and Mas-Colell [28], we have Theorem 2. There exists a unique adjusted potential function P for games with coalition structure. Moreover, for all (N, v, C) ∈ CG and i ∈ N, A i P(N, v, C) = SS i (N, v, C).
Proof. First, we show uniqueness. for any (N, v, C) ∈ CG and S ∈ C, from (10) and (11), we have following recursive form of the potential function P.
Together with P(∅, v, ∅) = 0, P(N, v, C) can be obtained by recursion and can be uniquely determined. Now, we show that for all (N, v, C) ∈ CG and i ∈ N, A i P(N, v, C) = SS i (N, v, C). We know that the Shapley-Solidarity value is characterized by EFF, IQBC, and CBC from the Corollary 1 and Calvo [24]. If we can prove that A i P(N, v, C) satisfies these three properties, we can claim that A i P(N, v, C) coincides with the Shapley-Solidarity value.
The EFF is obvious from the definition of the potential function. For any game with coalition structure (N, v, C) ∈ CG, h ∈ M, and i, j ∈ C h , if we want to prove that A i P(N, v, C) satisfies IQBC, we should prove the following equation.
where AP denotes AP (N, v, C). From the definition of the game (C h , v f ,C ) (4) and (11) − P(N\{j}, v, C N\{j} ) + P(N\{i, j}, v, C N\{i,j} ) It verifies that A i P(N, v, C) satisfies IQBC. It remains to prove that A i P(N, v, C) satisfies CBC. From (13), we know that ∑ i∈S A i P(N, v, C) = Sh S ([C], v C ). Because the Shapley value satisfies balanced contributions [4]. For any C i , C j ∈ C, we have Subsequently, we have Thus, the Shapley-Solidarity value satisfies CBC. And we have that A i P(N, v, C) = SS i (N, v, C).

The Coalitional Bidding Mechanism for the Shapley-Solidarity Value
Mechanism design can be seen as the part of Nash program to bridge the gap between cooperative and non-cooperative game theory. It is a significant approach to characterize the rationality of solutions for cooperative games, and it has been widely studied in the field of cooperative games. Pérez-Castrillo and Wettstein [33] firstly proposed a bidding mechanism to give rise to the Shapley value as the result of equilibrium behavior. Our coalitional bidding mechanism is similar to the coalition bidding mechanism for the Owen value [34], which is extended from the bidding mechanism for the Shapley value [33]. Both of the smechanisms have two round and the second round is the same while the difference between our mechanism for the Shapley-Solidarity value and the one for the Owen value lies in the first round. We first give a new bidding mechanism for the Solidarity value, and we will restrict the underlying game to monotonic games.

A New Bidding Mechanism for the Solidarity Value
Our bidding mechanism is inspired from Pérez-Castrillo and Wettestein's for the Shapley value. The Solidarity value and Shapley value are the excepted values with respect to different considerations of the marginal contributions. The Shapley value only takes care of every individual himself, and it uses the pure marginal contributions, while the Solidarity value uses the average marginal contributions which behaves as the property of solidarity. When a player joins or leaves a coalition, he will share their gains or losses with other players in the coalition rather than himself only. In our bidding mechanism, we will consider the property of solidarity in the Solidarity value. Now, we describe the bidding mechanism for the Solidarity value. When there is only one player i in the game, the player i receives v({i}). Suppose that the rules of the bidding mechanism is known when there are at most n − 1 players. The procedure of the bidding mechanism for a set of players N = {1, 2, ..., n} is as follows.
• Stage 1: the players bid for each other for electing a proposer, i.e. each player i ∈ N makes bid i denote the net bid of player i ∈ N. Find a player α be the proposer whose net bid is max among all the players. If there is more than one maximizer, then randomly choose a player from the maximizers. • Stage 2: the proposer α makes an offer x α j ∈ R to every player j ∈ N\{α}. • Stage 3: all other players, except proposer sequentially accept or reject the offer. If all other players agree the proposer, we say the offer is accepted otherwise the offer is rejected. If the offer is accepted, player j ∈ N\{α} receives x α j , and the proposer receives v(N) − ∑ j∈N\{α} x α j . Consider the bids in stage 1, the player j ∈ N\{α} totally receives x α j + b α j and the proposer eventually receives v(N) − ∑ j∈N\{α} (b α j + x α j ). If the offer is rejected, a player β randomly chosen from N with probability 1 n leaves the game and gets nothing. Note that the proposer and other players have same probability to be player β. Other players proceed with the game in same rules with player set N\{β}. In this case, when we consider the bids in stage 1, every player j other than proposer α gets b α j and proposer α loses ∑ j∈N\{α} b α j . The randomly chosen player β will be excluded in the rest of the games and his bid in stage 1 will not be changed.

Theorem 3.
For any monotonic game (N, v) ∈ G, the above mechanism implements the Solidarity value in any subgame perfect equilibrium (SPE).
Proof. We prove this result by induction on the number of players. Obviously, the theorem is true if there is only one player in the game. We assume that it holds for all player set number m ≤ n − 1. Now, we show that it is true for m = n.
Firstly, we construct a subgame perfect equilibrium whose outcome is the Solidarity value of game (N, v). Consider the following strategy profiles.
At stage 1, each player i ∈ N makes bids b i j = Sol j (N, v) − 1 n ∑ k∈N\{j} Sol j (N\{k}, v) to every player j ∈ N\{i}.
It is easy to check that every player other than the proposer obtains their Solidarity value. Because the Solidarity value is an efficient solution, the proposer also gets his Solidarity value.
In these strategy profiles, the net bids B i of every player i ∈ N is equal to zero by the equal averaged gains property of the Solidarity value.
=0. Now, we prove that the above strategies constitute a SPE. At stage 3, in the case of rejection, one of the players, including the proposer, is randomly chosen and he/she will be excluded in the next round. The players who are left in the game will play the subgame according to the same rules. Subsequently, we can obtain the Solidarity value as the outcome of those games by the induction hypothesis. If any player rejects the proposal, then the expected payoff for any player i ∈ N in the subgame is 1 n ∑ k∈N\{i} Sol i (N\{k}, v). Thus, each player i ∈ N\{α} accepts any offer x α i ≥ 1 n ∑ k∈N\{i} Sol i (N\{k}, v), and rejects any offer x α i < 1 n ∑ k∈N\{i} Sol i (N\{k}, v). Therefore, the strategies are best responses at stage 3.
At stage 2, the strategies are also best responses. According to these strategies, the payoff of α starting from stage 2 is where the last inequation holds from the fact that the game is a monotonic game. If he offers some player j the payoff x α j less than 1 n ∑ k∈N\{j} Sol j (N\{k}, v), the proposal is rejected and the expected payoff he will obtain is 1 n ∑ k∈N\{α} Sol α (N\{k}, v). If he offers some player j the value x α j higher than 1 n ∑ k∈N\{j} Sol j (N\{k}, v), the proposal is accepted, but his payoff is strictly worse off. Now, consider the strategies at stage 1. Obviously, if a player increases his total bid, then he will be chosen as the proposer, but his payoff will decrease. If a player decreases his total bid, then his payoff is invariable, since other players will be chosen as the proposer. Thus, the strategy is the best response at stage 1. Hence, the above strategies constitute a SPE.
The proof of any subgame perfect equilibrium yields the Solidarity value needs five claims. Claim a. In any SPE, at stage 3, each player j ∈ N\{α} accepts any offer if x α j > 1 n ∑ k∈N\{j} Sol j (N\{k}, v). The offer is rejected if x α j < 1 n ∑ k∈N\{j} Sol j (N\{k}, v) for at least some j ∈ N\{α}.
If the proposal of player α is rejected, the excepted payoff of a player j = α is 1 n ∑ k∈N\{j} Sol j (N\{k}, v) by the induction. Subsequently, the optimal strategy of the player j is that he accepts any offer higher than 1 n ∑ k∈N\{j} Sol j (N\{k}, v) and rejects any offer lower than 1 n ∑ k∈N\{j} Sol j (N\{k}, v). Claim b. If there is a player i ∈ N, such that v(N) > v(N\{i}), then the SPE strategies starting from stage 2 are as follows. At stage 2, the proposer α offers x α j = 1 n ∑ k∈N Sol j (N\{k}, v) to all j ∈ N\{α}, and at stage 3, j ∈ N\{α} accepts any offer x α j ≥ 1 n ∑ k∈N Sol j (N\{k}, v) and rejects the offer otherwise. If v(N) = v(N\{k}) for all k ∈ N, there exist the SPE strategies besides the previous SPE strategies. At stage 2, the proposer α offers x α j ≤ 1 n ∑ k∈N Sol j (N\{k}, v) to all j ∈ N\{α}, and at stage 3, j ∈ N\{α} rejects any offer x α j ≤ 1 n ∑ k∈N Sol j (N\{k}, v) and accepts the offer otherwise. We prove that the previous strategies constitute a SPE. Suppose that there is a player i ∈ N, such that v(N) > v(N\{i}). In the case of rejection, player α will expectantly receive 1 The ε is definitely exists from Equation (14) and v(N) > v(N\{i}).
The player α can improve his payoff by offering any player j ∈ N\{α} with 1 n ∑ k∈N\{j} Sol j (N\{k}, v) + ε n−1 . The offer will be accepted by claim a. Thus, in any SPE the offer of player α must be accepted. This implies that x α j ≥ 1 n ∑ k∈N\{j} Sol j (N\{k}, v) for all j ∈ N\{α}. Player α still can improve his payoff by offering 1 n ∑ k∈N\{j} Sol j (N\{k}, v) + ε n−1 to player j ∈ N\{α} with a smaller ε. These offers are accepted and α's payoff increases. Hence, x α j = 1 n ∑ k∈N\{j} Sol j (N\{k}, v) for all i = α at any SPE and, at stage 3, every agent i = α accepts any offer if x α j ≥ 1 n ∑ k∈N\{j} Sol j (N\{k}, v). If v(N) = v(N\{k}) for all k ∈ N, the proposer α offers at least 1 n ∑ k∈N\{j} Sol j (N\{k}, v) to every player j = α, so that the offer can be accepted by the same argument in the previous case. The proposer expectantly receive 1 n ∑ k∈N\{α} Sol α (N\{k}, v) in the case of rejection, which is identical to the payoff in the case of acceptation. Therefore, any offer that leads to a rejection is also a SPE.
Claim c. In any SPE, B i = B j = 0 for all i, j ∈ N. Claim d. In any SPE, the payoff of every player is invariable whoever is chosen as the proposer. The proofs of the above two claims are similar to the proof of Theorem 1 in Pérez-Castrillo and Wettstein [33], and we omit them.
Claim e. In any SPE, the final payoff of every player coincides with the Solidarity value. If a player i is the proposer, then the his payoff is where the last equality holds by the recursive formula of the Solidarity value [42]. By claim (d), we have x j i = x k i for all j, k. Thus Remark 1. Note that Xu et al. [31] also gave a bidding mechanism for the Solidarity value. When comparing our bidding mechanism with the work of Xu et al. [31], there is no difference between the two bidding mechanisms at Stage 1 and Stage 2, but an exceptional stage (Stage 0) is considered at the beginning of the mechanism in [31], where a i = 1 s v(S\{i}) is distributed for player i that is in the active player set S. They call a i as the compensation for player i from an ethical point of view. The main difference is at Stage 3. When the offer by proposer is rejected, a player β is randomly chosen from N with probability 1 n leaving the grand coalition in our bidding mechanism, while the rejected proposer leaves the grand coalition in the mechanism of Xu et al. [31].

Remark 2.
When comparing our bidding mechanism with Pérez-Castrillo and Wettstein's mechanism [33] for the Shapley value, there is only difference at Stage 3. In Pérez-Castrillo and Wettstein's mechanism, if the offer is rejected, then the proposer α will leave from the grand coalition N and take away his individual worth v({α}). It means that the proposer himself takes the full responsibility when his proposal is rejected by others. In our mechanism for the Solidarity value, if the offer is rejected, a player β is randomly chosen from all players with probability 1 n leaving the grand coalition N and gets nothing. It indicates the preference of egalitarianism from the property of solidarity, which is, all players (not only the proposer or any rejector) need to take the responsibility for the breakdown of the coalition when the proposal is rejected in our mechanism.

The Coalitional Bidding Mechanism for the Shapley-Solidarity Value
Vidal-Puga and Begantiños [34] extended the bidding mechanism for the Shapley value introduced in Pérez-Castrillo and Wettestein [33] to games with coalition structure. They used a two round coalitional bidding mechanism, where, at round 1, players in the same union play the bidding mechanism for obtaining the resources of the union and, at round 2, the players who have obtained the resources in round 1 play the bidding mechanism with the obtained resources.
In the former section, we have already proposed a new non-cooperative implementation of the Solidarity value. Next, we will use the coalitional bidding mechanism that was introduced in Vidal-Puga and Begantiños to implement the Shapley-Solidarity value. Considering the relationship between the Owen value and the Shapley-Solidarity value, we just need to change the first round of the coalitional bidding mechanism in the original implementation for the Owen value.
We will describe our bidding mechanism recursively. If there is only one player i, the player obtains v(i). Suppose that the mechanism is played at most n − 1 players. Then, for N = {1, · · · , n} and C = {C 1 , · · · , C m }, the procedure of the bidding mechanism is as follows.
Round 1. At this round, the players in any union C h ∈ C play the bidding mechanism for obtaining the resources of C h . If there is only one player i in C h , this player has his resources. Assume the mechanism played by at most |C h | − 1 players. For |C h | the process is as follows.
• Stage 1. Every player i ∈ C h makes bids b i j ∈ R for every j ∈ C h \{i}. The net bid Every union in C plays the bidding mechanism sequentially in the order C 1 , · · · , C m until we find C l 0 and α l 0 such that the offer of α l 0 is rejected or for any C l ∈ C the offer of α l is accepted.
If the offer of α l 0 is rejected by some player in C l 0 , then randomly choose one player from coalition C l 0 . Suppose that the player β l 0 is chosen then he leaves the game with nothing. Consider the bid in the first stage, all he acquires from the game is b α l 0 β l 0 if he is not the proposer otherwise he will lose ∑ j∈C l 0 \{α l 0 } b α l 0 j . The left players play the subgame (N , v , C ) with same rules, where N = N\{β l 0 }, v = v −β l 0 and C = C −β l 0 . If for any C l ∈ C the offer of α l is accepted, then the player α l becomes the "representative" of the coalition C l . The final payoff of the players other than the proposer in the coalition C l will get the bid in stage 1 and the offer in stage 3 that is given from the proposer. Accordingly, the payoff of the proposer in this round is p 1 He will go to round 2 with the resources of C l and the other players leave the game.
When the first round is finished, any coalition C l ∈ C have one representative r l . We denote C r l the set of players whose resources are obtained by representative r l . The set of the players C\C r l is the players that have been removed in C l .
Round 2. All of representatives N r = {r 1 , · · · , r m } play the bidding mechanism introduced by Pérez-Castrillo and Wettstein [33] according to the game (N r , v r ), which is defined by for any S ⊂ N r , v r (S) = v(∪ r l ∈S C r l ). For any r l ∈ N r , the payoff obtained by r l at round 2 is denoted by p 2 r l . The bidding mechanism for the Shapley value in Pérez-Castrillo and Wettstein needs that the underlying game is zero monotonic game i.e. the game (N r , v r ) should be a zero monotonic game. Thus, the game v should be a superadditive game. In our bidding mechanism for the Solidarity value, we restrict the underlying game to monotonic games. It is easy to check that, if a superadditive game is non-negative game, then the game is a monotonic game. Therefore, we will restrict the underlying game for implementing the Shapley-Solidarity value to the superadditive game where every coalition has non-negative worth. Proof. The result holds when there is only one player. Suppose the result holds for at most n − 1 players. Let N = {1, 2, ..., n}, and we consider the following strategies. Round 1. For any coalition C h ∈ C, we describe their strategies as follows.
• Stage 1. Every player i ∈ C h makes bids b i j = SS j (N, v, C) − 1 |C h | ∑ k∈C h SS j (N\{k}, v, C N\{k} ) for every j ∈ C h \{i}.

Round 2.
The representatives play the bidding mechanism in terms of the strategies described in Pérez-Castrillo and Wettstein [33].
Following the similar proof procedure in Theorem 2 of Vidual-Puga and Bergantiños [34], we can prove the theorem and we will omit it.

Remark 3.
Our non-cooperative implementation for the Shapley-Solidarity value is quit similar to the implementation for the Owen value. We just change the way to punish the players when the bargaining is broken in the first round.

Conclusions
Coalition structure is adopted in order to describe the situation where the players form groups for bargaining payoffs in cooperative games. The Shapley-Solidarity value provides a way of dividing the total payoffs among the players in a game with coalition structure. It employs the Shapley value among the unions and the Solidarity value among the members inside each union, by considering that the players within a union were more willing to show their solidarity and each union was more inclined to protect its revenue. In this paper, we study the characterizations of the Shapley-Solidarity value from both cooperative and non-cooperative aspects.
Firstly, we present two axiomatic characterizations of the Shapley-Solidarity value. We characterized the Shapley-Solidarity value is the only coalitional value that satisfies efficiency, coalitional symmetry, coalitional strong marginality, intracoalitional equal averaged gains (intracoalitional quasi-balanced contributions). Additioally, the Shapley-Solidarity value is the only coalitional value that satisfies efficiency, additivity, coalitional symmetry, null union, intracoalitional equal averaged gains (intracoalitional quasi-balanced contributions). In the axiom system, the axiom of intracoalitional equal averaged gains can be replaced by the axiom of intracoalitional quasi-balanced contributions for these two properties are equivalent for a coalitional value.
Secondly, we combine the A-potential function for the Solidarity value and the potential function for the Owen value, in order to obtain the potential function for the Shapley-Solidarity value. We prove that there exists a unique adjusted potential function for games with coalition structure. Moreover, for each player of a game with with coalition structure, the player's marginal contribution of the unique adjusted potential function coincides with its Shapley-Solidarity value.
Finally, we propose a bidding mechanism in order to implement the Solidarity value. At beginning, we introduce a new bidding mechanism for the Solidarity value, inspiring from Pérez-Castrillo and Wettestein's bidding mechanism for the Shapley value. In our bidding mechanism for the Solidarity value, if the offer is rejected, then a player is randomly chosen from all players with probability 1 n leaving the grand coalition and gets nothing. It means that all players (not only the proposer or any rejector) need to take the responsibility for the breakdown of the coalition when the proposal is rejected, from the property of solidarity. This is the main difference with the Pérez-Castrillo and Wettstein's implementation of the Shapley value. Subsequengly, by changing the first round of the two round mechanism in the original implementation for the Owen value, we extend the coalitional bidding mechanism that was introduced by Vidal-Puga and Begantiños to implement the Shapley-Solidarity value.