Next Article in Journal
Improved Initialization of the EM Algorithm for Mixture Model Parameter Estimation
Previous Article in Journal
On Porous Matrices with Three Delay Times: A Study in Linear Thermoelasticity
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Banzhaf-like Value for Cooperative Games with Interval Payoffs

1
School of Business, Central South University, Yuelu District, Changsha 410083, China
2
School of Economics and Management, South China Normal University, Guangzhou Higher Education Mega Center, No. 378, Waihuan Xi Road, Guangzhou 510006, China
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(3), 372; https://doi.org/10.3390/math8030372
Submission received: 7 February 2020 / Revised: 2 March 2020 / Accepted: 3 March 2020 / Published: 7 March 2020
(This article belongs to the Section Fuzzy Sets, Systems and Decision Making)

Abstract

:
By using Moore’s subtraction operator and a total order on the set of closed intervals, we introduce a new variation of the Banzhaf value for cooperative interval games called the interval Banzhaf-like value which may accommodate the shortcomings of the interval Banzhaf value. We first reveal the relation between this introduced value and the interval Banzhaf value. Then, we present two sets of properties that may be used to determine whether an interval value is median-indifferent to the interval Banzhaf-like value. Finally, in order to overcome the disadvantages of the interval Banzhaf-like value, we propose the contracted interval Banzhaf-like value and give an axiomatization of this proposed value.

1. Introduction

A cooperative game is represented by a pair ( N , v ) , where N is a nonempty and finite set of players, and v is a characteristic function from 2 N to R which assigns each coalition a real number. To cover a wider range of decision circumstances, the model of cooperative games was generalized either by changing the structure of the coalitions (See [1,2,3]), or by altering the nature of the characteristic function (See [4,5,6]). In the present paper, we study the model of cooperative interval games where the values of coalitions are assumed to be bounded and closed intervals of real numbers without any knowledge of related probability distribution on these obtained intervals.
The model of cooperative interval games was originally introduced by [7] to handle bankruptcy situations where the estate is known with certainty while claims belong to known bounded intervals of real numbers. Since then, it has been theoretically developed by a group of researchers around Branzei and Tijs (See [4,8] for details). This model can be used to approach the situations where the players wish to cooperate and know with certainty only the lower and upper bounds for the payoff of their cooperation. Examples are bankruptcy problems in [7], minimum spanning tree networks in [9,10], sealed bid second price auctions and flow situations in [8], etc.
The main focus of cooperative interval games are solutions that assign each given cooperative interval game a set of n-dimensional vectors which inform the players about the range of individual payoffs generated by cooperation. By using the arithmetic of intervals introduced by [11], the interval Shapley value and the interval Banzhaf value were separately proposed by [12,13] for a class of cooperative interval games so called the size monotonic interval games. Moreover, these two values were separately characterized by using a set of properties. One common disadvantage of these two notions is that both are only well-defined for size monotonic interval games. Therefore, the axiomatization and properties concerning these values could only be provided for this specific subclass of cooperative interval games as well. To avoid this disadvantage of the interval Shapley value, the interval Shapley-like value was proposed in [14] by using Moore’s subtraction operator. It has been shown that the interval Shapley-like value is definable for every possible cooperative interval games, and be characterized on the whole class of cooperative interval games.
Here, we introduce the notion of the interval Banzhaf-like value by using the interval subtraction operator in [11] so as to accommodate the mentioned disadvantage of the interval Banzhaf value introduced by [13]. It will be showed that the interval Banzhaf-like value is not only well-defined for every possible interval game, but also is median-indifferent to the interval Banzhaf value on the class of size monotonic interval games. Moreover, we offer two sets of properties about interval values. By using these properties, we may obtain the interval values that are median-indifferent to the interval Banzhaf-like value. Besides, as the interval Banzhaf-like value is provided with neither 2-players merging equivalence nor the uncertainty-removing property, we improve this value by introducing the contracted interval Banzhaf-like value, and present an axiomatization for this introduced value. It will be proved that the contracted interval Banzhaf-like value satisfies more desirable properties.
The rest of this paper is organized as follows. In Section 2, we recall the basic notions and operations with respect to the intervals of real numbers and the model of cooperative interval games. Section 3 is devoted to revealing the relation between the interval Banzhaf value and the interval Banzhaf-like value. In Section 4, we first show the properties of the interval Banzhaf-like value, and then present two sets of constraints to judge whether an interval value is median-indifferent to the interval Banzhaf-like value. Section 5 is dedicated to the contracted interval Banzhaf-like value and its axiomatization. We end this paper with a concluding remark in Section 6.

2. Preliminaries

This section is dedicated to the necessary notations, concepts and results concerning the intervals of real numbers and the model of cooperative interval games which are mainly from [11,14].
Let R be the real number set. Denote the set of all closed and bounded intervals on R by I ( R ) , and the length of interval I I ( R ) by | I | . For any α R and I , J I ( R ) with I = [ I ̲ , I ¯ ] and J = [ J ̲ , J ¯ ] , define that
  • I J = [ I ̲ + J ̲ , I ¯ + J ¯ ] ;
  • I J = [ I ̲ J ¯ , I ¯ J ̲ ] ;
  • α I = [ α I ̲ , α I ¯ ] i f α 0 ; [ α I ¯ , α I ̲ ] i f α < 0 .
These interval operators were originally introduced by [11], and frequently used to process interval calculations in the literature.
An alternative interval subtraction operator was proposed in [12] to approach the cooperative interval games as follows. For any I , J I ( R ) with I = [ I ̲ , I ¯ ] and J = [ J ̲ , J ¯ ] , I J = [ I ̲ J ̲ , I ¯ J ¯ ] if I ¯ J ¯ I ̲ J ̲ . This operator is only well-defined for an ordered interval pair ( I , J ) D where D = { ( I , J ) I ( R ) × I ( R ) I ¯ J ¯ I ̲ J ̲ } , while the former subtraction operator is definable for every pair of closed intervals. Note that for any intervals I , J I ( R ) , if I J is well defined, then I J is a subset of I J .
Within the model of cooperative interval games, it is usually assumed that the payoffs of coalitions are bound closed intervals of real numbers without any knowledge of related probability distribution of these payoffs. That means, if x [ a , b ] and y [ c , d ] , it is possible that x y [ a d , b c ] but x y [ a c , b d ] (given b d a c ). In view of this fact, it is more reasonable to employ the subtraction operator defined by [11] when dealing with the cooperative interval games in our framework.
A total order over the intervals was proposed by [14] in order to deal with wider range of interval comparisons. Let I , J I ( R ) with I = [ I ̲ , I ¯ ] and J = [ J ̲ , J ¯ ] . Suppose that
  • I is median-superior to J, denoted by I J , if I ̲ + I ¯ 2 > J ̲ + J ¯ 2 ;
  • I is weakly median-superior to J, denoted by I J , if I ̲ + I ¯ 2 J ̲ + J ¯ 2 ;
  • I and J are median-indifferent to each other, denoted by I J , if J ̲ + J ¯ 2 = I ̲ + I ¯ 2 .
As the above total order on the set of closed intervals is based on the medians of intervals (or the expectation of the uniform distribution), we rename the original terms in ([14] p. 463) so as to reflect this point.
A cooperative interval game is presented by a pair ( N , v ) where N is a nonempty finite set of players and v : 2 N I ( R ) is the characteristic function with v ( ) = [ 0 , 0 ] . For any S 2 N , v ( S ) = [ v ( S ) ̲ , v ( S ) ¯ ] is the worth of coalition S in ( N , v ) where v ( S ) ̲ and v ( S ) ¯ are respectively the minimal worth and the maximal worth that coalition S could receive when players in coalition S work together. For simplicity, denote ( N , v ) by v when N is known from the context. Let | S | be the cardinality of S where S 2 N and I G N be the family of all interval games with player set N, respectively.
For any ( N , v ) I G N with i , j N , let p = { i , j } , M = N \ { i , j } and N p = M { p } . A reduced game of ( N , v ) is defined as ( N p , v p ) where v p ( S ) = v ( S ) and v p ( S { p } ) = v ( S { i , j } ) for any S 2 M . Note that, v p is the characteristic function of an interval game with | N | 1 players which are obtained by merging the players i and j into one player termed as p.
For any v 1 , v 2 I G N and λ R , define that
  • ( v 1 + v 2 ) ( S ) = v 1 ( S ) v 2 ( S ) for any S 2 N ;
  • ( v 1 v 2 ) ( S ) = v 1 ( S ) v 2 ( S ) for any S 2 N ;
  • ( λ v 1 ) ( S ) = λ v 1 ( S ) for any S 2 N .
The following special notions proposed in [14] will play a crucial role in analysing the interval games in the sequel. For any v I G N , suppose that
  • v is uncertainty-free if | v ( S ) | = 0 for any S 2 N ;
  • v is [0,0]-indifferent if v ( S ) [ 0 , 0 ] for any S 2 N ;
  • v m is the median game with respect to v if v m ( S ) = [ v ( S ) ̲ + v ( S ) ¯ 2 , v ( S ) ̲ + v ( S ) ¯ 2 ] for any S 2 N ;
  • v u is the uncertainty-spread game with respect to v if v u ( S ) = [ | v ( S ) | 2 , | v ( S ) | 2 ] for any S 2 N .
Denote the set of all uncertainty-free interval games in I G N by U I G N and the set of all [ 0 , 0 ] -indifferent interval games by Z I G N . It can be easily verified that for any v I G N , v = v m + v u where v m U I G N and v u Z I G N .
Let v I G N and T 2 N \ { } . Define
  • ( N , u T f ) based on T as
    u T f ( S ) = [ 1 , 1 ] , i f T S ; [ 0 , 0 ] , o t h e r w i s e .
  • ( N , z T v u ( T ) ) based on T as
    z T v u ( T ) ( S ) = v u ( T ) , i f T = S ; [ 0 , 0 ] , o t h e r w i s e .
Clearly, u T f U I G N and z T v u ( T ) Z I G N for any T 2 N \ { } .
Lemma 1.
For any v I G N , there is a sequence of real numbers { β T } T 2 N \ { } such that v = T 2 N \ { } { β T u T f + z T v u ( T ) } .
Proof. 
For any v I G N , we get v = v m + v u . Since v m U I G N is equivalent to a classical cooperative game, we have that { u T f } T 2 N \ { } is a basis for U I G N . Accordingly, there is a sequence of real numbers { β T } T 2 N \ { } such that v m = T 2 N \ { } β T u T f . Moreover, v u = T 2 N \ { } z T v u ( T ) for any v u Z I G N . Thus, we have v = T 2 N \ { } { β T u T f + z T v u ( T ) } . □
Let I ( R ) N be the set of n-dimensional vectors with each component in I ( R ) where n is the cardinality of N. An interval value on I G N is a function Ψ : I G N I ( R ) N where n = | N | and the i-th coordinate of Ψ ( v ) represents the payoff for player i in N.
Two interval values Ψ and Ψ are said to be median-indifferent to each other, denoted by Ψ Ψ , if Ψ i ( v ) Ψ i ( v ) for any v I G N and any i N .
Lastly, we present a number of properties (or axioms) that an interval value may satisfy. Generally, an interval value may satisfy none of the following properties and it could also satisfy several properties simultaneously. An interval value Ψ : I G N I ( R ) N is said to satisfy:
  • Indifference efficiency (IEF): i N Ψ i ( v ) v ( N ) for any v I G N (In this text, the summation operator for closed intervals is according to the addition operator ⊕.
  • 2-players merging equivalence (2ME): Ψ i ( v ) Ψ j ( v ) = Ψ p ( N p , v p ) for any v I G N and i , j N with p = { i , j } .
  • Indifference 2-players merging equivalence(I2ME): Ψ i ( v ) Ψ j ( v ) Ψ p ( N p , v p ) for any v I G N and i , j N with p = { i , j } .
  • Indifference 2-players Super Additivity (I2SA): Ψ i ( v ) Ψ j ( v ) Ψ p ( N p , v p ) for any v I G N and i , j N with p = { i , j } .
  • Indifference Marginal Contributions (IMC): Let v , w I G N and i N . If for any S N \ { i } , v ( S { i } ) v ( S ) w ( S { i } ) w ( S ) , then Ψ i ( v ) Ψ i ( w ) .
  • Indifference Dummy Property (IDP): Ψ i ( v ) v ( { i } ) for any v I G N and any I-dummy player i in v where i is called a I-dummy player in v, if v ( S { i } ) v ( S ) v ( { i } ) for any S N \ { i } .
  • Symmetry (SYM): Ψ i ( v ) = Ψ j ( v ) for any v I G N and any symmetric players i and j in v where i and j are called symmetric players in v if v ( S { i } ) = v ( S { j } ) for any S N \ { i , j } .
  • Additivity (ADD): Ψ ( v 1 + v 2 ) = Ψ ( v 1 ) Ψ ( v 2 ) for any v 1 , v 2 I G N .
  • Uncertainty-removing Property (URP): | Ψ i ( v ) | = 0 for any v I G N and any uncertainty-removing player i in v where i is called a uncertainty-removing player in v, if | v ( S { i } ) | = 0 for any S N .
  • Equal Degree of Uncertainty (EDU): | Ψ i ( v ) | = | Ψ j ( v ) | for any v I G N and any i , j N .
IEF says that the sum of the players’ payoffs should be median-indifferent to the worth for grand coalition. This property is an extension of the well-known efficiency proposed by [15]. 2ME expresses that if we merge two players i and j into one player p, then the payoff for p should agree with the sum of their respective payoffs, whereas I2ME requires that if we merge two players i and j into one player p, then the payoff for p should be median-indifferent to the sum of their respective payoffs. Both of them are extensions of the 2-efficiency proposed in [16] for the values of classical cooperative games. I2SA claims that if we merge two players i and j into one player p, the payoff for p should be weakly superior to the sum of their payoffs. This property is an extension of the 2-players super additivity in [16].
IMC requires that if player i’s marginal contributions to all coalitions in two distinct games are median-indifferent to each other, then the payoffs for i received in these two games should be median-indifferent to each other. IDP expresses that if a player i’s marginal contribution to any coalition is median-indifferent to the worth from i’s individual action, then the payoff distributed for i should also be median-indifferent to the worth of i’s individual action. These two properties are generalizations of the marginal contributions and of the dummy property in [17], separately. SYM and ADD are straightforward extensions of the symmetry and of the additivity in [16], respectively.
As far as we know, none property concerning the division of uncertainty degree among the players has been proposed within the framework of interval cooperative games. In view of this, we formulate the properties of EDU and of URP. EDU expresses that the uncertainty degree of each player’s payoff is identical. URP says that if there exists an uncertainty-removing player who has more information or the ability to forecast payoffs of any involved coalitions accurately, then the payoff distributed for this player should be free from uncertainty.

3. Comparison between the Interval Banzhaf Value and the Interval Banzhaf-like Value

In order to approach the cooperative interval games, the notion of interval Banzhaf value was proposed in [13].
The interval Banzhaf value for v I G N is given as B ( v ) = ( B 1 ( v ) , B 2 ( v ) , , B n ( v ) ) where B i ( v ) = 1 2 | N | 1 S N \ { i } { v ( S { i } ) v ( S ) } for any i N . As the interval subtraction operator employed in this notion is only well-defined for an ordered interval pair ( I , J ) with | I | | J | , B is undefinable for interval games which are not size monotonic, where a game v I G N is called a size monotonic game if | v ( S ) | | v ( T ) | for any S , T 2 N with S T . Denote S M I G N the class of size monotonic interval games in I G N . To clarify this point, see the following example.
Example 1.
Consider ( N , v ) in Table 1. Due to | v ( { 1 , 2 , 3 } ) | < | v ( { 2 , 3 } ) | and | v ( { 1 , 3 } ) | < | v ( { 1 } ) | , v is not a size monotonic interval game. As neither v ( { 1 , 2 , 3 } ) v ( { 2 , 3 } ) nor v ( { 1 , 3 } ) v ( { 1 } ) is definable, B ( v ) is undefinable.
To overcome this mentioned shortcoming of the interval Banzhaf value, we propose an alternative Banzhaf value for cooperative interval games. We term this proposal as the interval Banzhaf-like value to distinguish it from the interval Banzhaf value introduced in [13].
Definition 1.
The interval Banzhaf-like value for v I G N is defined as B ( v ) = ( B 1 ( v ) , B 2 ( v ) , , B n ( v ) ) where B i ( v ) = 1 2 | N | 1 S N \ { i } { v ( S { i } ) v ( S ) } for any i N .
As the interval subtraction operator used in this definition is well-defined for any interval pair ( I , J ) , the interval Banzhaf-like value is definable for every possible interval game in I G N . Reconsider the interval game v in Table 1. We have that B ( v ) = ( [ 3 , 21 4 ] , [ 14 4 , 23 4 ] , [ 3 , 21 4 ] ) , but B ( v ) does   not   exist . It is important to point out that given v I G N , B ( v ) is not necessarily the same as B ( v ) even through both B ( v ) and B ( v ) are definable. To show this statement, we represent the example in [13] as follows.
Example 2.
Consider ( N , w ) in Table 2 which is size monotonic. B ( w ) = ( [ 5 2 , 7 2 ] , [ 9 2 , 11 2 ] , [ 5 , 6 ] ) whereas B ( w ) = ( [ 3 2 , 9 2 ] , [ 7 2 , 13 2 ] , [ 4 , 7 ] ) .
The next theorem reveals the relation between the interval Banzhaf-like value and the interval Banzhaf value.
Theorem 1.
B ( v ) B ( v ) for any v S M I G N .
Proof. 
For any v S M I G N , i N and S N \ { i } , we have
v ( S { i } ) v ( S ) = [ v ( S { i } ) ̲ v ( S ) ¯ , v ( S { i } ) ¯ v ( S ) ̲ ] [ v ( S { i } ) ̲ + v ( S { i } ) ¯ 2 v ( S ) ̲ + v ( S ) ¯ 2 , v ( S { i } ) ̲ + v ( S { i } ) ¯ 2 v ( S ) ̲ + v ( S ) ¯ 2 ] [ v ( S { i } ) ̲ v ( S ) ̲ , v ( S { i } ) ¯ v ( S ) ¯ ] = v ( S { i } ) v ( S ) .
Moreover, for any i N , we get that S N \ { i } { v ( S { i } ) v ( S ) } S N \ { i } { v ( S { i } ) v ( S ) } and 1 2 | N | 1 S N \ { i } { v ( S { i } ) v ( S ) } 1 2 | N | 1 S N \ { i } { v ( S { i } ) v ( S ) } . Thus, B ( v ) B ( v ) . □
Note that, both the interval Banzhaf-like value and the interval Banzhaf value coincide with the Banzhaf value in [16] whenever a cooperative interval game degenerates into a classical cooperative game.

4. The Properties for the Interval Banzhaf-like Value and its Median-Indifference Values

The next proposition shows the properties that the interval Banzhaf-like value is provided with.
Proposition 1.
The interval Banzhaf-like value B satisfies I2ME, IDP, SYM, IMC, ADD and EDU.
Proof. 
It is easy to prove that B satisfies SYM and ADD.
Take any v I G N and any i , j N with p = { i , j } . Then
B p ( v p ) = 1 2 | N | 2 S N \ { p } { v p ( S { p } ) v p ( S ) } = 1 2 | N | 2 S N \ { i , j } { v ( S { i , j } ) v ( S ) } B i ( v ) = 1 2 | N | 1 S N \ { i } { v ( S { i } ) v ( S ) } = 1 2 | N | 1 S N \ { i , j } { v ( S { i , j } ) v ( S { j } ) v ( S { i } ) v ( S ) } B j ( v ) = 1 2 | N | 1 S N \ { j } { v ( S { j } ) v ( S ) } = 1 2 | N | 1 S N \ { i , j } { v ( S { i , j } ) v ( S { i } ) v ( S { j } ) v ( S ) } B i ( v ) B j ( v ) = 1 2 | N | 1 S N \ { i , j } 2 { v ( S { i , j } ) v ( S ) } 1 2 | N | 1 S N \ { i , j } { v ( S { i } ) v ( S { i } ) } 1 2 | N | 1 S N \ { i , j } { v ( S { j } ) v ( S { j } ) } 1 2 | N | 1 S N \ { i , j } 2 { v ( S { i , j } ) v ( S ) } = 1 2 | N | 2 S N \ { i , j } { v ( S { i , j } ) v ( S ) } = 1 2 | N | 2 S N p \ { p } { v p ( S { p } ) v p ( S ) } = B p ( v p ) .
Thus, B satisfies I2ME.
Let v I G N and i be an I-dummy player in v. For any S N \ { i } , we get 1 2 { v ( S { i } ) ¯ + v ( S { i } ) ̲ } = 1 2 { v ( S ) ¯ + v ( S ) ̲ + v ( { i } ) ¯ + v ( { i } ) ̲ } and v ( S { i } ) v ( S ) = [ v ( S { i } ) ̲ v ( S ) ¯ , v ( S { i } ) ¯ v ( S ) ̲ ] [ v ( { i } ) ̲ , v ( { i } ) ¯ ] . Then, B i ( v ) = 1 2 | N | 1 S N \ { i } { v ( S { i } ) v ( S ) } [ v ( { i } ) ̲ , v ( { i } ) ¯ ] . Thus, B satisfies IDP.
Let v , w I G N and i N . If { v ( S { i } ) v ( S ) } { w ( S { i } ) w ( S ) } for any S N \ { i } , then we get B i ( v ) = 1 2 | N | 1 S N \ { i } ( v ( S { i } ) v ( S ) ) 1 2 | N | 1 S N \ { i } ( w ( S { i } ) w ( S ) ) = B i ( w ) . Thus, B satisfies IMC.
Lastly, we prove that B satisfies EDU. For any v I G N and i N , we have
| B i ( v ) | = 1 2 | N | 1 S N \ { i } | v ( S { i } ) v ( S ) | = 1 2 | N | 1 S N \ { i } | v ( S { i } ) | + | v ( S ) | = 1 2 | N | 1 S N | v ( S ) | .
Thus, | B i ( v ) | = | B j ( v ) | for any i , j N . □
Remark 1.
B satisfies I2SA, but violates IEF, 2ME and URP.
As I2ME is a stronger property than I2SA, B satisfies I2SA. To verify the second point in Remark 1, consider the following example.
Example 3.
Reconsider ( N , v ) in Example 1. We have that i N B i ( v ) = [ 19 2 , 65 4 ] , whereas v ( N ) = [ 12 , 13 ] . Clearly, i N B i ( v ) v ( N ) does not hold. Amalgamating the players 1 and 2 into one player p, a reduced interval game can be obtained as described in Table 3. We have that B p ( w ) = [ 8 , 9.5 ] , whereas B 1 ( v ) B 2 ( v ) = [ 13 2 , 11 ] .
Consider ( N , v ) in Table 4. We get B ( v ) = ( [ 7 2 , 5 ] , [ 9 2 , 6 ] , [ 9 2 , 6 ] ) . Player 1 is an uncertainty-removing player in v. However, | B 1 ( v ) | 0 .
In contrast, it can be verified that the interval Banzhaf value satisfies 2ME, IDP, SYM, IMC and ADD, but violates both IEF and EDU over the class of size monotonic interval games.
Generally, for a given interval game, there exist more than one interval values that are median-indifferent to the Banzhaf-like value. Thus, it is meaningful to find out the conditions for the determination of these values.
Theorem 2.
If an interval value Ψ : I G N I ( R ) N satisfies I2ME, IDP, SYM and IMC, then Ψ ( v ) B ( v ) for any v I G N .
Proof. 
As v v m for any v I G N , and both Ψ and B satisfy IMC, we get Ψ ( v ) Ψ ( v m ) and B ( v ) B ( v m ) . Thus, in order to prove Ψ ( v ) B ( v ) , it is sufficient to prove Ψ ( v m ) B ( v m ) .
Step 1: Let | T | = t . If t 2 , then by I2ME, SYM and IDP, we have that Ψ i ( u T f ) [ 1 2 | T | 1 , 1 2 | T | 1 ] if i T , and that Ψ i ( u T f ) [ 0 , 0 ] if i T . Suppose that the above statement holds for | T | = t m (where m is an integer and m > 2 ). Consider the case with | T | = t = m + 1 . For any i , j T , let p = { i , j } . Take the reduced game ( N p , v p ) where v = u T f . By the above induction hypothesis, we get Ψ p ( v p ) [ 1 2 t 1 , 1 2 t 1 ] . Since Ψ satisfies I2ME and SYM, we have that Ψ i ( v ) = Ψ j ( v ) [ 1 2 t , 1 2 t ] = B i ( u T f ) = B j ( u T f ) . As Ψ satisfies IDP and any i N \ T is an I-dummy player in u T f , we have that Ψ i ( v ) [ 0 , 0 ] = B i ( u T f ) . Therefore, Ψ ( u T f ) B ( u T f ) for any T 2 N \ { } . Similarly, we may obtain that Ψ ( β u T f ) B ( β u T f ) for any β R and T 2 N \ { } .
Step 2: Let v I G N . By Lemma 1, there exists a unique sequence of { β T f } T 2 N \ { } (where β T f R ) such that v m = T 2 N \ { } β T f u T f . Then, take Z c ( v m ) = { T 2 N \ { } v m = T 2 N \ { } β T f u T f and β T f 0 } . For any v I G N with | Z c ( v m ) | = 1 , there exists a unique β R such that v m = β u T f . Based on the conclusion in Step 1, we have Ψ ( v m ) B ( v m ) .
Suppose that Ψ ( v m ) B ( v m ) for any ( N , v ) I G N with | N | n , and that Ψ ( v m ) B ( v m ) for ( N , v ) I G N with | N | = n + 1 if | Z c ( v m ) | k (where k 1 and k is a positive integer). Consider any v I G N with | N | = n + 1 and | Z c ( v m ) | = k + 1 . Then, there exists a sequence of coalitions T 1 , . . . , T k + 1 such that v m = r = 1 k + 1 β T r f u T r f . Let T = T 1 T k + 1 . Due to k + 1 2 , we get N \ T .
(i) Take i N \ T and ( N , v m ) where v m = r : i T r , 1 r k + 1 β T r f u T r f . Due to | Z c ( v m ) | k , we get Ψ ( v m ) B ( v m ) . Moreover, it can be verified that v m ( S { i } ) v m ( S ) = v m ( S { i } ) v m ( S ) for any S N \ { i } . As both Ψ and B satisfy IMC, we get Ψ i ( v m ) Ψ i ( v m ) and B i ( v m ) B i ( v m ) . Because of Ψ ( v m ) B ( v m ) implying Ψ i ( v m ) B i ( v m ) , we have that Ψ i ( v m ) B i ( v m ) for   each i N \ T . (ii) Take j T and amalgamate j with the given i N \ T . Put p = { i , j } and consider v m p which is the median game of v p . According to the former induction hypothesis, we have Ψ p ( v m p ) B p ( v m p ) . As both Ψ and B satisfy I2ME, we may conclude that Ψ p ( v m p ) ( Ψ i ( v m ) Ψ j ( v m ) ) and B p ( v m p ) ( B i ( v m ) B j ( v m ) ) , which implies Ψ j ( v m ) B j ( v m ) . Therefore, Ψ ( v m ) B ( v m ) for any v I G N with | N | = n + 1 and | Z c ( v m ) | = k + 1 .
To sum up, we may conclude that Ψ ( v ) B ( v ) for any v I G N . □
Remark 2.
Theorem 2 does not hold anymore if I2ME is replaced by I2SA without changing other properties.
To clarify this remark, consider the interval value Ψ : I G N I ( R ) N where Ψ i ( v ) inf { v ( S { i } ) v ( S ) } for any i N with S N \ { i } . It can be proved that Ψ satisfies I2SA, IDP, SYM, IMC. However, Ψ B does not hold.
Since the interval value that satisfies the mentioned properties is not unique, it is interesting to further narrow down the category of these interval values. The next theorem shows that a more specific kind of interval values can be identified by replacing I2ME and IMC in Theorem 2 with I2SA, ADD and EDU.
Theorem 3.
If an interval value Ψ : I G N I ( R ) N satisfies I2SA, IDP, SYM, ADD and EUC, then Ψ ( v ) B ( v ) for any v I G N . Moreover, given a v I G N , there exists a real number α R such that | Ψ i ( v ) | = α | B i ( v ) | for any i N .
Proof. 
Take any v I G N . Since v = v m v u , and by the fact that Ψ and B satisfy ADD, we have that Ψ ( v ) = Ψ ( v m ) Ψ ( v u ) and B ( v ) = B ( v m ) B ( v u ) . In order to prove that Ψ ( v ) B ( v ) , it is sufficient to prove that Ψ ( v m ) B ( v m ) and Ψ ( v u ) B ( v u ) both hold.
As v u ( S ) [ 0 , 0 ] for any S 2 N \ { } , we may conclude that any i N is an I- d u m m y player in v u . Since both Ψ and B satisfy IDP, we get Ψ ( v u ) B ( v u ) . The next step is to prove that Ψ ( v m ) B ( v m ) . Let S , T 2 N \ { } and k be a nonnegative integer. Define g T { k ; n } I G N with n is the cardinality of N and
g T { k ; n } ( S ) = [ 1 , 1 ] i f k | T S | ; [ 0 , 0 ] otherwise .
Suppose Ψ is an interval value on I G N satisfying I2SA, IDP, SYM, ADD and EDU. Then, for any u T f U I G N , we have
Ψ ( ( | T | 1 ) u T f ) Ψ ( g T { | T | 1 ; n } ) = T : T T , | T | = | T | 1 Ψ ( u T f ) .
As both Ψ and B satisfy IDP, it can be verified that Ψ ( v m ) B ( v m ) for any v I G N wih | N | = 1 ; and that Ψ ( u T f ) B ( u T f ) for any u T f U I G N with | T | = 1 .
S t e p 1: Suppose that Ψ ( u T f ) B ( u T f ) for any u T f U I G N with | N | n , and that Ψ ( u T f ) B ( u T f ) for any u T f U I G N with | T | k (where k 1 ) and | N | = n + 1 . Then we get
Ψ i ( u T f ) [ 1 2 | T | 1 , 1 2 | T | 1 ] , i f i T ; Ψ i ( u T f ) [ 0 , 0 ] , o t h e r w i s e .
As Ψ satisfies ADD, by Lemma 1, we get that Ψ ( v m ) B ( v m ) for any v I G N with | N | n .
S t e p 2: Let u T f U I G N with | N | = n + 1 and | T | = k + 1 . As Ψ satisfies IDP and SYM, there exist two intervals a = [ a ̲ , a ¯ ] and b = [ b ̲ , b ¯ ] satisfying the following conclusions:
Ψ i ( u T f ) [ a ̲ , a ¯ ] i f i T ; Ψ i ( u T f ) [ 0 , 0 ] i f i T .
Ψ i ( g T { k ; n + 1 } ) [ b ̲ , b ¯ ] i f i T ; Ψ i ( g T { k ; n + 1 } ) [ 0 , 0 ] i f i T .
By combining the (1), (2), (3) and the induction hypothesis, we get that
k [ a ̲ , a ¯ ] + [ b ̲ , b ¯ ] = [ k a ̲ + b ̲ , k a ¯ + b ¯ ] [ | T | 1 2 k 1 , | T | 1 2 k 1 ] = [ k 2 k 1 , k 2 k 1 ] .
(i) Let i , j T and p = { i , j } . Amalgamating i to j in u T f , we derive u T f , n (as above T = T \ { i } ). By I2SA, we have
[ 2 a ̲ , 2 a ¯ ] [ 1 2 k 1 , 1 2 k 1 ] .
(ii) Let i , j T and p = { i , j } . By amalgamating i to j in g T { k ; n + 1 } , we get ( N , g T { k ; n } ) in which N = N \ { i , j } { p } , T = T \ { i , j } { p } and
g T { k ; n } = [ 1 , 1 ] , i f p S and k 2 | ( S \ { p } ) T | ; [ 0 , 0 ] , o t h e r w i s e .
Due to | N | = n and | T | = k , by the induction hypothesis and (3), we have
Ψ p ( g T { k ; n } ) = [ k 2 k 1 , k 2 k 1 ] and [ 2 b ̲ , 2 b ¯ ] [ k 2 k 1 , k 2 k 1 ] .
According to (5) and (6), we have
[ k a ̲ + b ̲ , k a ¯ + b ¯ ] [ k 2 k + k 2 k , k 2 k + k 2 k ] = [ k 2 k 1 , k 2 k 1 ] .
According to (4) and (7), we have [ a ̲ , a ¯ ] [ 1 2 k , 1 2 k ] . By means of ADD, we get that for any c 0 , | N | = n + 1 and T 2 N \ { } ,
Ψ i ( c · u T f ) [ c 2 | T | 1 , c 2 | T | 1 ] , if i T ; Ψ i ( c · u T f ) [ 0 , 0 ] , if i T .
Thus, we have Ψ ( v m ) B ( v m ) for any v I G N with | N | = n + 1 .
To sum up, we may conclude that for any v I G N Ψ ( v m ) B ( v m ) and Ψ ( v u ) B ( v u ) , which implies Ψ ( v ) B ( v ) . As Ψ satisfies EDU, we get that | Ψ i ( v ) | = | Ψ j ( v ) | for any i , j N . According to Proposition 1, there exists a real number α R such that | Ψ i ( v ) | = α | B i ( v ) | . □
As showed in Proposition 1, the interval Banzhaf-like value satisfies ADD and EDU. Thus we may conclude that B i = B i ( v m ) 1 2 | N | 1 S N v u ( S ) for any i N . Theorem 3 expresses an important fact that the fundamental differences between B and the other interval values that satisfy the mentioned properties in Theorem 3 are the sizes of uncertainty distributed among players.
It is important to mention that neither Theorem 2 nor Theorem 3 holds in reverse direction. To clarify this point, we present two counterexamples as follows.
(1)
Take Ψ : I G N I ( R ) N where Ψ i ( v ) = B i ( v m ) [ i , i ] for any v I G N , N = { 1 , 2 , , n } and i N . It can be verified that Ψ B , but violates the property of SYM.
(2)
Take Ψ : I G N I ( R ) N where Ψ i ( v ) = B i ( v m ) [ inf j N { | v ( j ) | } , inf j N { | v ( j ) | } ] for any v I G N and i , j N . It can be verified that Ψ B . Moreover, there exists α R such that | Ψ i ( v ) | = α | B i ( v ) | for any i N . However, Ψ fails to satisfy the property of ADD.
In order to compare the properties in Theorem 2 and properties in Theorem 3, we propose the Remark 3.
Remark 3.
If an interval value Ψ : I G N I ( R ) N satisfies I2SA, IDP, SYM, ADD and EDU, then Ψ satisfies I2ME, IDP, SYM, and IMC, but not vice versa.
Proof. 
Assume that Ψ : I G N I ( R ) N satisfies I2SA, IDP, SYM and ADD.
By Theorem 3, we get that Ψ i ( v ) B i ( v ) for any v I G N and i N . Let v I G N and i , j N . By amalgamating i , j N into p = { i , j } , we obtain ( N p , v p ) . Then Ψ p ( v p ) B p ( v p ) . Since B satisfies I2ME, we have Ψ p ( v p ) B p ( v p ) ( B i ( v ) B j ( v ) ) ( Ψ i ( v ) Ψ j ( v ) ) . Thus, Ψ satisfies I2ME.
Let v , w I G N . Let i , j N with that ( v ( S { i } ) v ( S ) ) ( w ( S { i } ) w ( S ) ) for any S 2 N . As B satisfies IMC, we have B i ( v ) B i ( w ) for any i N . As Ψ ( v ) B ( v ) for any v I G N , we have Ψ ( v ) Ψ ( w ) .
Let v I G N and D ( N , v ) = { i N | there   exists   a j N \ { i } such   that i and j are   symmetric   in v } . Define Ψ : I G N I ( R ) N as that for any v I G N , Ψ i ( v ) = B i ( v m ) I i where I i = [ 1 , 1 ] if i D ( N , v ) and I i = [ 0 , 0 ] if i N \ D ( N , v ) . Then, we get that Ψ satisfies I2ME, IDP, SYM and IMC, but violates EDU. □
In view of this fact, we may conclude that the properties used in Theorem 3 are more demanding than the ones used in Theorem 2. Besides, it is necessary to point out that the interval value that satisfies the mentioned properties in Theorem 3 is not unique. Hence, it is still meaningful to further narrow down the category of these indifference values.

5. The Contracted Interval Banzhaf-like Value and Its Axiomatization

Since the interval Banzhaf-like value satisfies neither 2ME nor URP, it is still desirable to search for an interval value that is not only median-indifferent to the interval Banzhaf-like value, but also able to accommodate the disadvantages of the interval Banzhaf-like value. With this aim, inspired from Proposition 1 and Theorem 3, we formulate the contracted interval Banzhaf-like value as follows.
Definition 2.
The contracted interval Banzhaf-like value is defined as CB : I G N I ( R ) N where CB i ( v ) = B i ( v m ) 1 2 | N | 1 v u ( N ) for any v I G N and i N .
The above notion says that the contracted interval Banzhaf-like value distributes equally payoff uncertainty to players in accordance with the uncertainty of worth for the grand coalition rather than the sum of coalitions’ payoff uncertainties.
Reconsider the interval games v in Table 1 and w in Table 2. We have that CB ( v ) = ( [ 4 , 17 4 ] , [ 9 2 , 19 4 ] , [ 4 , 17 4 ] ) and CB ( w ) = ( [ 21 8 , 27 8 ] , [ 37 8 , 43 8 ] , [ 41 8 , 47 8 ] ) . It can be verified that CB ( v ) B ( v ) and CB ( w ) B ( w ) .
The next result shows that the contracted interval Banzhaf-like value possesses all the properties mentioned in Theorem 3.
Proposition 2.
The contracted interval Banzhaf-like value satisfies I2SA, IDP, SYM, ADD and EDU.
Proof. 
As B satisfies both I2SA and IDP, and CB ( v ) B ( v m ) for any v I G N , it can be inferred that CB satisfies I2SA and IDP.
Since | CB i ( v ) | = 1 2 | N | 1 | v ( N ) | for any v I G N and i N , we obtain that CB satisfies EDU.
Let i , j N be symmetric players in v I G N . As B satisfies SYM, we get B i ( v m ) = B j ( v m ) . By EDU, we have CB i ( v ) = CB j ( v ) . Thus, CB satisfies SYM.
For any v , w I G N and i N , we have CB i ( v ) = B i ( v m ) 1 2 | N | 1 v u ( N ) and CB i ( w ) = B i ( w m ) 1 2 | N | 1 w u ( N ) . Then we get
CB i ( v ) CB i ( w ) = B i ( v m ) B i ( w m ) 1 2 | N | 1 ( v u ( N ) w u ( N ) ) = B i ( v m + w m ) 1 2 | N | 1 ( v u + w u ) ( N ) = CB i ( v + w ) .
Thus, CB satisfies ADD. □
It can be obtained from Definition 2 that the contracted interval Banzhaf-like value satisfies URP. In contrast, the interval Banzhaf-like value does not possess this property. Moreover, it can be inferred that CB satisfies the properties of I2ME and of IMC according to Proposition 2 and Remark 3.
Theorem 4.
The contracted interval Banzhaf-like value is the unique interval value satisfying 2ME, IDP, SYM, ADD and URP.
Proof. 
It can be not difficult verified that CB : I G N I ( R ) N satisfies 2ME, IDP, SYM, ADD and URP.
Let v I G N and Ψ be an interval value that satisfies 2ME, IDP, SYM, ADD and URP. It can be verified that Ψ ( v ) CB ( v ) B ( v m ) . As v = v m + v u , it is sufficient to prove that Ψ ( v m ) = CB ( v m ) and Ψ ( v u ) = CB ( v u ) .
For any i N , i is an uncertainty removing player in v m . By URP, we have | Ψ i ( v m ) | = | CB i ( v m ) | = 0 . Since Ψ ( v m ) CB ( v m ) , it can be inferred that Ψ i ( v m ) = CB i ( v m ) for any i N . As v u ( S ) [ 0 , 0 ] for any S 2 N , we can conclude that i is an I-dummy player in v u for any i N . Thus, Ψ i ( v u ) B i ( v u ) CB i ( v u ) [ 0 , 0 ] .
For any T N and i N \ T , i is an uncertainty removing player in z T v u ( T ) . By URP, we get Ψ i ( z T v u ( T ) ) = [ 0 , 0 ] . Take i T and j N \ T . By amalgamating i and j, and denoting p = { i , j } , we obtain ( N p , η T p ) where η T = z T v u ( T ) . We conclude that η T p ( S ) = [ 0 , 0 ] for any S N p . As p is not only an I-dummy player but also an uncertainty nullifying player in η T p , we have that Ψ p ( η T p ) = [ 0 , 0 ] . Since Ψ satisfies 2ME, it can be concluded that Ψ i ( η T ) Ψ j ( η T ) = Ψ p ( η T p ) . Thus, Ψ i ( η T ) = [ 0 , 0 ] for any i T .
Take T = N . Since Ψ satisfies 2ME and SYM, by the method of induction, it can be inferred that Ψ i ( z T v u ( T ) ) = 1 2 | N | 1 z T v u ( T ) ( N ) = 1 2 | N | 1 v u ( N ) for any i N . As v u = T 2 N \ { } z T v u ( T ) , by ADD, we get that
Ψ i ( v u ) = Ψ i ( T 2 N \ { } z T v u ( T ) ( T ) ) = T 2 N \ { } Ψ i ( z T v u ( T ) ( T ) ) = Ψ i ( z N v u ( N ) ( N ) ) = 1 2 | N | 1 v u ( N ) .
In order to show the independence between the properties mentioned in Theorem 4, we present the following counterexamples.
Example 4.
  • Take Ψ : I G N I ( R ) N where
    Ψ i ( v ) = S N \ { i } | S | ! ( | N | | S | 1 ) ! | N | ! { v m ( S { i } ) v m ( S ) }
    for any v I G N and i N . It can be verified that Ψ satisfies IDP, SYM, ADD and URP, but violates 2ME.
  • Take Ψ : I G N I ( R ) N where Ψ i ( v ) = v ( N ) 2 | N | 1 for any v I G N and i N . It can be verified that Ψ satisfies 2ME, SYM, ADD and URP, but violates IDP.
  • Let { λ i } i N be a set of positive real numbers with i N λ i = 1 and λ i λ j for any i , j N . Assume that λ p = λ i + λ j for any i , j N with p = { i , j } . Take Ψ : I G N I ( R ) N as Ψ i ( v ) = B i ( v m ) λ i v u ( N ) for any v I G N and i N . It can be verified that Ψ satisfies 2ME, IDP, ADD and URP, but violates SYM.
  • Define Ψ : I G N I ( R ) N as Ψ i ( v ) = B i ( v m ) 1 2 | N | 1 I for any v I G N and i N where
    I = [ 1 , 1 ] , i f | v u ( N ) | > 0 ; [ 0 , 0 ] , i f | v u ( N ) | = 0 .
    It can be verified that Ψ satisfies 2ME, IDP, SYM and URP, but violates ADD.
  • Define Ψ : I G N I ( R ) N as Ψ i ( v ) = B i ( v m ) 1 2 | N | 1 I for any v I G N and i N where I = [ v ( N ) ¯ + v ( N ) ̲ 2 , v ( N ) ¯ + v ( N ) ̲ 2 ] . It can be verified that Ψ satisfies 2ME, IDP, SYM and ADD, but violates URP.
In view of the above facts, we may conclude that the properties used in Theorem 4 are independent.

6. Concluding Remarks

In this paper, we firstly proposed the interval Banzhaf-like value for cooperative interval games to overcome the shortcomings of the interval Banzhaf value introduced in [13]. The interval Banzhaf-like value is well-defined for every possible interval game, whereas the interval Banzhaf value is only definable for size monotonic interval games. As we have shown in Theorem 1, the interval Banzhaf-like value is median-indifferent to the interval Banzhaf value whenever the latter interval value exists. Based on these facts, we conclude that the interval Banzhaf-like value outperforms the interval Banzhaf value in dealing with cooperative games with interval payoffs.
We also introduced two sets of properties about interval values which can be treated as the sufficient conditions for judging whether an interval value is median-indifferent to the interval Banzhaf-like value. In view of the shortcomings of the interval Banzhaf-like value, we came up with the contracted interval Banzhaf-like value by reducing the uncertainty degree of the interval Banzhaf-like value. It has been shown that the contracted interval Banzhaf-like value not just overcomes the mentioned deficiencies of the interval Banzhaf-like value, but also may be characterized by using a set of properties. For these reasons, the theory of the contracted interval Banzhaf-like value may be treated as an improvement of the interval Banzhaf-like value theory.
Recall the definition of interval Shapley-like value in ([14] p. 466), it can be proved that the interval Shapley-like value satisfies the properties of IDP, of SYM, of IMC and of ADD. Besides, it can be verified that the interval Shapley-like value violates 2ME, I2ME, I2SA, EDU and URP (see the counterexample ( N , v ) in Table 1). Since the interval Shapley-like value, the interval Banzhaf-like value and the contracted interval Banzhaf-like value all can be used as the measures of power in decision making, it is necessary to make a comparison between these interval values. We summarize the commonalities and differences between them in Table 5 and Table 6, respectively.
Based on the results in Table 5 and Table 6, we may conclude that the interval Banzhaf-like value and the contracted interval Banzhaf-like value both have more aspects of rationality than the interval Shapley-like value. Moreover, in view of the fairness about the uncertainty distribution among players, the contracted interval Banzhaf-like value performs better than the interval Banzhaf-like value in measuring the power of players.

Author Contributions

Conceptualization, W.F.; Formal analysis, C.T. and W.F.; Funding acquisition, C.T.; Methodology, W.F. and W.H.; Project administration, C.T.; Supervision, C.T. and W.H.; Writing—original draft, W.F.; Writing—review & editing, W.H. All authors have read and agreed to the published version of the manuscript.

Funding

This work was partly supported by National Natural Science Foundation of China (Nos. 71671188, 71271217, and 71571192), the major project for National NSFC (No. 71790615), Natural Science Foundation of Hunan Province, China (No. 2016JJ1024) and South China Normal University (No.508/671182).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Borkotokey, S. Cooperative games with fuzzy coalitions and fuzzy characteristic functions. Fuzzy Sets Syst. 2008, 159, 138–151. [Google Scholar] [CrossRef]
  2. Meng, F.Y.; Zhang, Q. The Shapley function for fuzzy cooperative games with multilinear extension form. Appl. Math. Lett. 2010, 23, 644–650. [Google Scholar] [CrossRef] [Green Version]
  3. Tan, C.; Jiang, Z.; Chen, X.; Ip, W.H. A Banzhaf function for a fuzzy game. IEEE Trans. Fuzzy Syst. 2014, 22, 1489–1502. [Google Scholar] [CrossRef]
  4. Branzei, R.; Branzei, O.; Gök, S.Z.A.; Tijs, S. Cooperative interval games: A survey. Central Eur. J. Oper. Res. 2010, 18, 397–411. [Google Scholar] [CrossRef]
  5. Carpente, L.; Casas-Méndez, B.; García-Jurado, I.; Van Den Nouweland, A. Coalitional interval games for strategic games in which players cooperate. Theory Decis. 2008, 65, 253–269. [Google Scholar] [CrossRef]
  6. Tan, C.; Jiang, Z.; Chen, X. Choquet extension of cooperative games. Asia-Pac. J. Oper. Res. 2013, 30, 229–317. [Google Scholar] [CrossRef]
  7. Branzei, R.; Dimitrov, D.; Tijs, S. Shapley-like values for interval bankruptcy games. Econ. Bull. 2003, 3, 1–8. [Google Scholar]
  8. Branzei, R.; Mallozzi, L.; Tijs, S. Peer group situations and games with interval uncertainty. Game Theory Appl. 2012, 15, 1–8. [Google Scholar]
  9. Montemanni, R. A Benders decomposition approach for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 2006, 174, 1479–1490. [Google Scholar] [CrossRef] [Green Version]
  10. Moretti, S.; Gök, S.Z.A.; Branzei, R.; Tijs, S. Connection situations under uncertainty and cost monotonic solutions. Comput. Oper. Res. 2011, 38, 1638–1645. [Google Scholar] [CrossRef] [Green Version]
  11. Moore, R.E. Methods and Applications of Interval Analysis; Society for Industrial and Applied Mathematics (SIAM): Philadelphia, PA, USA, 1979; Volume 2. [Google Scholar]
  12. Gök, S.Z.A.; Branzei, R.; Tijs, S. The interval Shapley value: An axiomatization. Central Eur. J. Oper. Res. 2010, 18, 131–140. [Google Scholar]
  13. Pusillo, L. Banzhaf Like Value for Games with Interval Uncertainty. Czech Econ. Rev. 2013, 7, 5–15. [Google Scholar]
  14. Han, W.; Sun, H.; Xu, G. A new approach of cooperative interval games: The interval core and Shapley value revisited. Oper. Res. Lett. 2012, 40, 462–468. [Google Scholar] [CrossRef]
  15. Shapley, L.S. A value for n-person games. Contrib. Theory Games 1953, 2, 307–317. [Google Scholar]
  16. Lehrer, E. An axiomatization of the Banzhaf value. Int. J. Game Theory 1988, 17, 89–99. [Google Scholar] [CrossRef]
  17. Nowak, A.S. On an axiomatization of the Banzhaf value without the additivity axiom. Int. J. Game Theory 1997, 26, 137–141. [Google Scholar] [CrossRef]
Table 1. (N,v).
Table 1. (N,v).
S{1}{2}{3}{1,2}{1,3}{2,3}{1,2,3}
v(S)[2, 4][3, 4][3, 4][8, 9][7, 8][7, 9][12, 13]
Table 2. (N,w).
Table 2. (N,w).
S{1}{2}{3}{1,2}{1,3}{2,3}{1,2,3}
w(S)[2, 3][3, 4][4, 5][6, 8][6, 8][9, 11][12, 15]
Table 3. ( N p , w ) .
Table 3. ( N p , w ) .
S{p}{3}{p,3}
w(S)[8, 9][3, 4][12, 13]
Table 4. (N,v).
Table 4. (N,v).
S{1}{2}{3}{1,2}{1,3}{2,3}{1,2,3}
v(S)[3,3][2,4][2,4][7,7][7,7][8,10][15,15]
Table 5. The commonalities between Φ , B and CB .
Table 5. The commonalities between Φ , B and CB .
IDPSYMIMCADD
Φ YYYY
𝓑 YYYY
𝓒 𝓑 YYYY
Table 6. The differences between Φ , B and CB .
Table 6. The differences between Φ , B and CB .
IEF2MEI2MEI2SAEDUURP
Φ YNNNNN
𝓑 NNYYYN
𝓒 𝓑 NYYYYY

Share and Cite

MDPI and ACS Style

Tan, C.; Feng, W.; Han, W. On the Banzhaf-like Value for Cooperative Games with Interval Payoffs. Mathematics 2020, 8, 372. https://doi.org/10.3390/math8030372

AMA Style

Tan C, Feng W, Han W. On the Banzhaf-like Value for Cooperative Games with Interval Payoffs. Mathematics. 2020; 8(3):372. https://doi.org/10.3390/math8030372

Chicago/Turabian Style

Tan, Chunqiao, Wenrui Feng, and Weibin Han. 2020. "On the Banzhaf-like Value for Cooperative Games with Interval Payoffs" Mathematics 8, no. 3: 372. https://doi.org/10.3390/math8030372

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop