1 Introduction

A cooperative game with transferable utility for a finite player set (TU game or simply game) is given by a coalition function that assigns a worth to any coalition (subset of the player set), where the empty coalition obtains zero. (One-point) solutions for TU games assign a payoff to any player in any TU game. Besides the Shapley value (Shapley 1953), the Banzhaf value (Banzhaf 1965; Owen 1975) probably is one of the most eminent one-point solutions for TU games.

Young (1985) characterizes the Shapley value by three properties of solutions: efficiency, symmetry, and marginality. Efficiency: the players’ payoffs sum up to the worth generated by the grand coalition. Symmetry: equally productiveFootnote 1 players obtain the same payoff. Marginality: a player’s payoff only depends on her own productivity. In a sense, this characterization indicates that the Shapley value is the unique efficient solution that reflects the players productivities.

Recently, Casajus (2021) suggests a second-order version of Young’s (1985) characterization of the Shapley value. This characterization is based on the notions of the players’ second-order productivities and second-order payoffs. A player’s second-order productivity with respect to another player reflects how the former affects the latter player’s productivity (see Footnote 1); a player’s second-order payoff with respect to another player reflects how the former affects the latter player’s payoff by leaving the game. The Shapley value is the unique solution that satisfies efficiency and second-order versions of symmetry and marginality. Second-order symmetry: players who are equally second-order productive with respect to a third player obtain the same second-order payoff with respect to this third player. Second-order marginality: a player’s second-order payoff with respect to another player only depends on her own second-order productivity with respect to this other player. In a sense, this characterization indicates that the Shapley value is the unique efficient solution that reflects the players’ second-order productivities in terms of their second-order payoffs.

In this paper, we suggest and discuss second-order characterizations of the Banzhaf value derived from its characterization by Lehrer (1988) and Casajus (2012) using just two properties, standardness for two-player games (Hart and Mas-Colell 1989) or the dummy player property and 2-efficiency (Lehrer 1988). Standardness for two-player games: the payoffs for two-player games coincide with most of the solutions in the literature, in particular, the Shapley value, the Banzhaf value, and the nucleolus (Schmeidler 1969). Dummy player property: if a player’s productivity is constant, then her payoff reflects (equals) her productivity. 2-efficiency: A solution is neutral with respect to the payoffs of amalgamated players. More precisely, if two players are amalgamated, then their payoffs sum up to the payoff of the amalgamated player. In a sense, this characterization indicates that the Banzhaf value is the unique amalgamation neutral solution that reflects the players’ productivities.Footnote 2

In particular, we suggest and discuss second-order versions of standardness for two-player games, the dummy player property, and 2-efficiency. Second-order standardness for two-player games: the second-order payoffs for two-player games coincide with most of the solutions in the literature. Second-order dummy player property: if a player’s second-order productivity with respect to another player is constant, then her payoff reflects (equals half of) her second-order productivity. Second-order 2-efficiency: If two players are amalgamated, then their second-order payoffs with respect to a third player sum up the second-order payoff of the amalgamated player with respect to the third player in the amalgamated game.

We obtain a number of characterizations of the Banzhaf value invoking the following properties: (i) [second-order standardness for two-player games or the second-order dummy player property] and 2-efficiency (Theorem 7), (ii) standardness for one-player games,Footnote 3 standardness for two-player games, and second-order 2-efficiency (Theorem 10), (iii) standardness for one-player games, [second-order standardness for two-player games or the second-order dummy player property], and second-order 2-efficiency (Theorem 12). Cum grano salis, the latter, for example, indicates that the Banzhaf value is the unique second-order amalgamation neutral solution that reflects the players’ second-order productivities. These characterizations also work within the classes of simple games, of superadditive games, and of simple superadditive games (Remarks 9, 11, and 14).

The remainder of this paper is organized as follows. In Sect. 3, we provide basic definitions and notation. In Sect. 4, we survey the characterizations of the Banzhaf value due to Lehrer (1988) and Casajus (2012). In Sect. 5, we survey second-order productivity and second-order payoffs. In Sect. 6, we discuss second-order versions of standardness for two-player games, the dummy player property, and 2-efficiency. In Sect. 7, we provide characterizations of the Banzhaf value using these properties. Some remarks conclude the paper.

2 Basic definitions and notation

This section closely follows Casajus (2020) or Casajus (2021).

Let the universe of players \({\mathfrak {U}}\) be a countably infinite set, and let \({\mathcal {N}}\) denote the set of all finite subsets of \({\mathfrak {U}}\). The cardinalities of \(S,T,N\in {\mathcal {N}}\) are denoted by st,  and n,  respectively. A (finite TU) game for the player set \(N\in {\mathcal {N}}\) is given by a coalition function \(v:2^{N}\rightarrow {\mathbb {R}}\), \(v\left( \emptyset \right) =0,\) where \(2^{N}\)denotes the power set of N. Subsets of N are called coalitions; \(v\left( S\right)\) is called the worth of coalition S. The set of all games for N is denoted by \({\mathbb {V}} \left( N\right)\); the set of all games is denoted by \({\mathbb {V}}:=\bigcup _{N\in {\mathcal {N}}}{\mathbb {V}}\left( N\right) .\)

For \(N\in {\mathcal {N}}\), \(T\subseteq N,\) and \(v\in {\mathbb {V}}\left( N\right)\), the subgame \(v|_{T}\in {\mathbb {V}}\left( T\right)\) is given by \(v|_{T}\left( S\right) =v\left( S\right)\) for all \(S\subseteq T;\) for \(i\in N\) and \(S\subseteq N,\) we occasionally write \(v_{-i}\) and \(v_{-S}\) instead of \(v|_{N\setminus \left\{ i\right\} }\) or \(v|_{N\setminus S},\) respectively. For \(N\in {\mathcal {N}}\), \(v,w\in {\mathbb {V}}\left( N\right) ,\) and \(\alpha \in {\mathbb {R}}\), the coalition functions \(v+w\in {\mathbb {V}}\left( N\right)\) and \(\alpha \cdot v\in {\mathbb {V}}\left( N\right)\) are given by \(\left( v+w\right) \left( S\right) =v\left( S\right) +w\left( S\right)\) and \(\left( \alpha \cdot v\right) \left( S\right) =\alpha \cdot v\left( S\right)\) for all \(S\subseteq N.\) For \(N\in {\mathcal {N}},\) the game \({\textbf{0}}^{N}\in {\mathbb {V}}\left( N\right)\) given by \({\textbf{0}} ^{N}\left( S\right) =0\) for all \(S\subseteq N\) is called the null game for N. For \(N\in {\mathcal {N}}\) and \(T\subseteq N,\) \(T\ne \emptyset ,\) the game \(u_{T}^{N}\in {\mathbb {V}}\) given by \(u_{T}^{N}\left( S\right) =1\) if \(T\subseteq S\) and \(u_{T}^{N}\left( S\right) =0\) otherwise is called a unanimity game. Any \(v\in {\mathbb {V}}\left( N\right) ,\) \(N\in {\mathcal {N}},\) can be uniquely represented by unanimity games. In particular, we have

$$\begin{aligned} v=\sum _{T\subseteq N:T\ne \emptyset }\lambda _{T}\left( v\right) \cdot u_{T}^{N}, \end{aligned}$$
(1)

where the coefficients \(\lambda _{T}\left( v\right)\) are known as the Harsanyi dividends (Harsanyi 1959), which can be determined recursively by

$$\begin{aligned} \lambda _{T}\left( v\right) \equiv v\left( T\right) -\sum _{S\subsetneq T:S\ne \emptyset }\lambda _{S}\left( v\right) . \end{aligned}$$
(2)

A game \(v\in {\mathbb {V}}\left( N\right) ,\) \(N\in {\mathcal {N}},\) is called simple if \(v\left( S\right) \in \left\{ 0,1\right\}\) for all \(S\subseteq N;\) it is called superadditive if \(v\left( S\cup T\right) \ge v\left( S\right) +v\left( T\right)\) for all \(S,T\subseteq N\) such that \(S\cap T=\emptyset .\)

A solution for \({\mathbb {V}}\) is an operator that assigns to any \(N\in {\mathcal {N}}\), \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i\in N\) a payoff \(\varphi _{i}\left( v\right) .\) The Shapley value (Shapley 1953) for \({\mathbb {V}}\), \(\textrm{Sh}\), is given by

$$\begin{aligned} \textrm{Sh}_{i}\left( v\right) \equiv \sum _{T\subseteq N:i\in T}\frac{\lambda _{T}\left( v\right) }{t}=\sum _{S\subseteq N\setminus \left\{ i\right\} }\frac{v\left( S\cup \left\{ i\right\} \right) -v\left( S\right) }{n\cdot \left( {\begin{array}{c}n-1\\ s\end{array}}\right) } \end{aligned}$$
(3)

for all \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i\in N.\) The Banzhaf value (Banzhaf 1965; Owen 1975) for \({\mathbb {V}},\) \(\textrm{Ba},\) is given by

$$\begin{aligned} \textrm{Ba}_{i}\left( v\right) \equiv \sum _{T\subseteq N:i\in T}\frac{\lambda _{T}\left( v\right) }{2^{t-1}}=\sum _{S\subseteq N\setminus \left\{ i\right\} }\frac{v\left( S\cup \left\{ i\right\} \right) -v\left( S\right) }{2^{n-1}} \end{aligned}$$
(4)

for all \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i\in N.\)

3 First-order approaches to the Banzhaf value

Lehrer (1988) introduces the notion of amalgamated players/games. For all \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i,j\in N,\) \(i\ne j,\) the amalgamated game \(v_{ij}\in {\mathbb {V}}\left( N{\setminus }\left\{ j\right\} \right)\) is given by

$$\begin{aligned} v_{ij}\left( S\right) =v\left( S\right) \quad \text {and\quad }v_{ij}\left( S\cup \left\{ i\right\} \right) =v\left( S\cup \left\{ i,j\right\} \right) \qquad \text {for all }S\subseteq N\setminus \left\{ i,j\right\} . \end{aligned}$$
(5)

In the game \(v_{ij}\), players i and j are amalgamated into the (amalgamated) player i. That is, player i behaves as if player j “sits on her shoulders” and brings her productivity with her.Footnote 5 Based on this notion, he introduces the following property of solutions.

2-efficiency, 2E. For all \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i,j\in N,\) \(i\ne j,\) we have \(\varphi _{i}\left( v\right) +\varphi _{j}\left( v\right) =\varphi _{i}\left( v_{ij}\right) .\)

This property can be paraphrased as follows: a solution is required to be neutral with respect to the payoffs of amalgamated players.

Lehrer (1988, Remark 3) characterizes the Banzhaf value using two properties: 2-efficiency and standardness for two-player games (Hart and Mas-Colell 1989).

Standardness for two-player games, ST2. For all \(i,j\in {\mathfrak {U}},\) \(i\ne j\) and \(v\in {\mathbb {V}}\left( \left\{ i,j\right\} \right) ,\) we have

$$\begin{aligned} \varphi _{i}\left( v\right) =v\left( \left\{ i\right\} \right) +\frac{v\left( \left\{ i,j\right\} \right) -v\left( \left\{ i\right\} \right) -v\left( \left\{ j\right\} \right) }{2}\overset{(\text {2})}{=}\lambda _{\left\{ i\right\} }\left( v\right) +\frac{\lambda _{\left\{ i,j\right\} }\left( v\right) }{2}. \end{aligned}$$

For two-player games, this property requires a solution to assign the standard payoff to the players, that is, the same payoffs as most solutions in the literature, for example, the Banzhaf value itself, the Shapley value, and the nucleolus (Schmeidler 1969). This property indicates that for two-player games a solution reflects the players’ productivities as given by their marginal contributions.

Theorem 1

(Lehrer 1988) The Banzhaf value is the unique solution for \({\mathbb {V}}\) that satisfies standardness for two-player games (ST2) and 2-efficiency (2E).

Later on, Casajus (2012, Theorem 7) replaces standardness for two-player games with the dummy player property.Footnote 6

For all \(N\in {\mathcal {N}}\), \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i\in N,\) player i is called a dummy player in v if

$$\begin{aligned} v\left( T\cup \left\{ i\right\} \right) -v\left( T\right) =v\left( \left\{ i\right\} \right) \qquad \text {for all }T\subseteq N\setminus \left\{ i\right\} . \end{aligned}$$

Dummy, D. For all \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}} \left( N\right) ,\) and \(i\in N\) such that i is a dummy player in v,  we have \(\varphi _{i}\left( v\right) =v\left( \left\{ i\right\} \right) .\)

The dummy player property can be paraphrased as follows: if a player’s productivity as given by her marginal contributions is constant, then her payoff should reflect (equal) this constant productivity.

Theorem 2

(Casajus 2012) The Banzhaf value is the unique solution for \({\mathbb {V}}\) that satisfies the dummy player property (D) and 2-efficiency (2E).

4 Second-order productivity and second-order payoffs

The marginal contributions of a player \(i\in N,\) \(N\in {\mathcal {N}}\) in the game \(v\in {\mathbb {V}}\left( N\right)\) given as

$$\begin{aligned} v\left( S\cup \left\{ i\right\} \right) -v\left( S\right) ,\qquad S\subseteq N\setminus \left\{ i\right\} \end{aligned}$$
(6)

indicate her (individual) productivity or contribution to the generation of worth in the game v. Recently, Casajus (2021) introduces the notions of the players’ second-order productivities and second-order payoffs. Second-order productivities are conceptualized as second-order marginal contributions: the second-order marginal contributions of player \(i\in N,\) \(N\in {\mathcal {N}},\) with respect to player \(j\in N{\setminus }\left\{ i\right\}\) in a game \(v\in {\mathbb {V}}\left( N\right)\) are given as

$$\begin{aligned} \left[ v\left( S\cup \left\{ i,j\right\} \right) -v\left( S\cup \left\{ i\right\} \right) \right] -\left[ v\left( S\cup \left\{ j\right\} \right) -v\left( S\right) \right] ,\qquad S\subseteq N\setminus \left\{ i,j\right\} . \end{aligned}$$
(7)

These describe how player i affects the productivity of player j.Footnote 7

The second-order payoff of player \(i\in N,\) \(N\in {\mathcal {N}},\) with respect to player \(j\in N\setminus \left\{ i\right\}\) in a game \(v\in {\mathbb {V}}\left( N\right)\) is given by \(\varphi _{j}\left( v\right) -\varphi _{j}\left( v_{-i}\right) .\) It describes how player i affects the payoff of player j by leaving the game.Footnote 8

Using second-order marginal contributions and second-order payoffs, one can define second-order versions of (first-order) properties of solutions (see Casajus 2021).

5 Second-order properties of solutions

In this section, we introduce and discuss second-order versions of standardness for two-player games, the dummy player property, and 2-efficiency.

5.1 Second-order standardness for two-player games

In one player games, (almost) all solutions assign the singleton worth to the player as her (standard) payoff. Standardness for two-player games requires a solution to assign the standard payoffs for two player games. This allows us to translate standardness for two-player games into second-order payoffs.

Second-order standardness for two-player games, 2ST2. For all \(i,j\in {\mathfrak {U}},\) \(i\ne j,\) and \(v\in {\mathbb {V}}\left( \left\{ i,j\right\} \right) ,\) we have

$$\begin{aligned} \varphi _{i}\left( v\right) -\varphi _{i}\left( v_{-j}\right) =\frac{v\left( \left\{ i,j\right\} \right) -v\left( \left\{ i\right\} \right) -v\left( \left\{ j\right\} \right) }{2}\overset{(\text {2})}{=}\frac{\lambda _{\left\{ i,j\right\} }\left( v\right) }{2}. \end{aligned}$$

For two-player games, this property requires the second-order payoffs of a solution to coincide with the standard second-order payoffs, that is, the second-order payoffs of most solutions in the literature. For the Banzhaf value and the Shapley value, this is immediate from (4) and (3), respectively. This property indicates that for two-player games a solution reflects the players’ second-order productivities as given by their second-order marginal contributions.

Remark 3

Both the Banzhaf value and the Shapley value satisfy second-order standardness for two-player games (2ST2).

We conclude this subsection by clarifying the relation between standardness for two-player games and second-order standardness for two-player games: they do not imply each other. Consider the solutions \(\textrm{Ba}^{\div 2}\) and \(\textrm{Two}\) for \({\mathbb {V}}\) given by

$$\begin{aligned} \textrm{Ba}_{i}^{\div 2}\left( v\right) \equiv \frac{n}{2}\cdot \textrm{Ba} _{i}\left( v\right) \qquad \text {for all }N\in {\mathcal {N}}\text {, } v\in {\mathbb {V}}\left( N\right) \text {, and }i\in N, \end{aligned}$$

and

$$\begin{aligned} \textrm{Two}_{i}\left( v\right) \equiv \sum _{\ell \in N\setminus \left\{ i\right\} }\frac{\lambda _{\left\{ i,\ell \right\} }\left( v\right) }{2}\qquad \text {for all }N\in {\mathcal {N}}\text {, }v\in {\mathbb {V}}\left( N\right) \text {, and }i\in N. \end{aligned}$$
(8)

The solution \(\textrm{Ba}_{i}^{\div 2}\) satisfies standardness for two-player games but not second-order standardness for two-player games. The solution \(\textrm{Two}\) satisfies second-order standardness for two-player games but not standardness for two-player games.Footnote 9

5.2 The second-order dummy player property

A player is a dummy player in a game if all her marginal contributions equal her marginal contribution to the empty set. Analogously, a player is a second-order dummy player with respect to another player if all her second-order marginal contributions with respect to this player equal her second-order marginal contribution with respect to this player to the empty set. For all \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i,j\in N,\) \(i\ne j,\) player i is called a second-order dummy player with respect to j in v if

$$\begin{aligned}&\left[ v\left( T\cup \left\{ i,j\right\} \right) -v\left( T\cup \left\{ i\right\} \right) \right] -\left[ v\left( T\cup \left\{ j\right\} \right) -v\left( T\right) \right] \\&\left. \quad =\right. \left[ v\left( \left\{ i,j\right\} \right) -v\left( \left\{ i\right\} \right) \right] -\left[ v\left( \left\{ j\right\} \right) -v\left( \emptyset \right) \right] \overset{(\text {2})}{=}\lambda _{\left\{ i,j\right\} }\left( v\right) \end{aligned}$$

for all \(T\subseteq N{\setminus }\left\{ i,j\right\} .\)Footnote 10

Note that this definition is symmetric with respect to i and j. That is, player i is a second-order dummy player with respect to j,  whenever j is a second-order dummy player with respect to i. Hence, one could say that they are second-order dummies to each other. This is also reflected by the following characterization of second-order dummy players in terms of Harsanyi dividends.Footnote 11

Lemma 4

For all \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i,j\in N,\) \(i\ne j,\) player i is a second-order dummy player with respect to j in v if and only if \(\lambda _{T\cup \left\{ i,j\right\} }\left( v\right) =0\) for all \(T\subseteq N{\setminus }\left\{ i,j\right\} ,\) \(T\ne \emptyset .\)

Proof

The claim trivially holds true for \(n\le 2.\) Let now \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i,j\in N\) be as in the lemma and \(n>2.\) By Casajus (2021, Equation 7), we have

$$\begin{aligned} \left[ v\left( T\cup \left\{ i,j\right\} \right) -v\left( T\cup \left\{ j\right\} \right) \right] -\left[ v\left( T\cup \left\{ i\right\} \right) -v\left( T\right) \right] =\sum _{S\subseteq T}\lambda _{S\cup \left\{ i,j\right\} }\left( v\right) . \end{aligned}$$

for \(T\subseteq N\setminus \left\{ i,j\right\} .\) The claim now easily follows by induction on t\(\square\)

The dummy player property requires a dummy player’s payoff to equal her marginal contribution to the empty set. Whereas marginal contributions can be attributed to a single player, second-order marginal contributions can be equally attributed to both players involved. Taking this into account, the second-order version of the dummy player property requires the second-order payoff of a second-order dummy player with respect to another player to equal half of her second-order contribution with respect to this player to the empty set.Footnote 12 Another way to motivate the division by two is as follows. The dummy player property requires a dummy player to obtain her standard payoff in the restriction of the game to this player. Analogously, the second-order dummy player property requires two players who are dummies to each other to “obtain” their standard second-order payoffs in the restriction of the game to the two players.

Second-order dummy, 2D. For all \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i,j\in N,\) \(i\ne j\) such that i is a second-order dummy player with respect to j in v,  we have

$$\begin{aligned} \varphi _{j}\left( v\right) -\varphi _{j}\left( v_{-i}\right) =\frac{\left[ v\left( \left\{ i,j\right\} \right) -v\left( \left\{ i\right\} \right) \right] -\left[ v\left( \left\{ j\right\} \right) -v\left( \emptyset \right) \right] }{2}\overset{(\text {2})}{=} \frac{\lambda _{\left\{ i,j\right\} }\left( v\right) }{2}. \end{aligned}$$
(9)

It is well-known that both the Shapley value and the Banzhaf value satisfy the dummy player property. They also satisfy the second-order dummy player property.

Lemma 5

Both the Banzhaf value and the Shapley value satisfy the second-order dummy player property (2D).

Proof

For \(N\in {\mathcal {N}}\textbf{,}\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i,j\in N,\) \(i\ne j,\) we obtain

$$\begin{aligned}{} & {} \textrm{Ba}_{i}\left( v\right) -\textrm{Ba}_{i}\left( v_{-j}\right) \nonumber \\{} & {} \quad \overset{(\text {4})}{=}\sum _{S\subseteq N\setminus \left\{ i,j\right\} }\frac{\left[ v\left( S\cup \left\{ i,j\right\} \right) -v\left( S\cup \left\{ j\right\} \right) \right] -\left[ v\left( S\cup \left\{ i\right\} \right) -v\left( S\right) \right] }{2^{n-1}}. \end{aligned}$$
(10)

By Casajus (2021, Proof of Proposition 5), we also have

$$\begin{aligned}{} & {} \textrm{Sh}_{j}\left( v\right) -\textrm{Sh}_{j}\left( v_{-i}\right) \nonumber \\ {}{} & {} \quad =\sum _{S\subseteq N\setminus \left\{ i,j\right\} }\frac{\left[ v\left( S\cup \left\{ i,j\right\} \right) -v\left( S\cup \left\{ i\right\} \right) \right] -\left[ v\left( S\cup \left\{ j\right\} \right) -v\left( S\right) \right] }{n\cdot \left( \begin{array}{l}{n-1}\\ {s+1}\end{array}\right) }. \end{aligned}$$
(11)

One easily checks that the coefficients of the second-order marginal contributions in (10) and (11) sum up to 1/2. This implies that both \(\textrm{Sh}\) and \(\textrm{Ba}\) satisfy 2D. \(\square\)

We conclude this subsection by clarifying the relation between the dummy player property and the second-order dummy player property: they do not imply each other. Consider the solutions \(\textrm{One}\) and \(\textrm{Ba}^{+1}\) for \({\mathbb {V}}\) given by

$$\begin{aligned} \textrm{One}_{i}\left( v\right) \equiv v\left( \left\{ i\right\} \right) \overset{(\text {2})}{=}\lambda _{\left\{ i\right\} }\left( v\right) \qquad \text {for all }N\in {\mathcal {N}}\text {, }v\in {\mathbb {V}}\left( N\right) \text {, and }i\in N, \end{aligned}$$
(12)

and

$$\begin{aligned} \textrm{Ba}_{i}^{+1}\left( v\right) \equiv \textrm{Ba}_{i}\left( v\right) +1\qquad \text {for all }N\in {\mathcal {N}}\text {, }v\in {\mathbb {V}}\left( N\right) \text {, and }i\in N. \end{aligned}$$
(13)

The solution \(\textrm{One}\) satisfies the dummy player property but not the second-order dummy player property. The solution \(\textrm{Ba}_{i}^{+1}\) satisfies the second-order dummy player property but not the dummy player property.

5.3 Second-order 2-efficiency

2-efficiency can be translated into second-order payoffs in a straightforward way.

Second-order 2-efficiency, 22E. For all \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i,j,k\in N,\) \(i\ne j\ne k\ne i,\) we have

$$\begin{aligned} \varphi _{k}\left( v_{ij}\right) -\varphi _{k}\left( \left( v_{ij}\right) _{-i}\right) =\varphi _{k}\left( v\right) -\varphi _{k}\left( v_{-i}\right) +\varphi _{k}\left( v\right) -\varphi _{k}\left( v_{-j}\right) . \end{aligned}$$

When two players are amalgamated, then their second-order payoffs with respect to a third player sum up to the second-order payoff of the amalgamated player with respect to this third player in the amalgamated game. This property can be paraphrased as follows: a solution is neutral with respect to the second-order payoffs of amalgamated players.

In contrast to the Banzhaf value, the Shapley value fails 2-efficiency. The same holds true for second-order 2-efficiency. In order to see that the Shapley value fails second-order 2-efficiency consider \(v=u_{N}^{N}\) for \(N\in {\mathcal {N}}\) with \(n>2.\) In contrast, the Banzhaf value also satisfies second-order 2-efficiency.

Lemma 6

The Banzhaf value satisfies second-order 2-efficiency (22E).

Proof

For \(N\in {\mathcal {N}},\) \(v\in {\mathbb {V}}\left( N\right) ,\) and \(i,j,k\in N,\) \(i\ne j\ne k\ne i,\) we have

$$\begin{aligned}&\textrm{Ba}_{k}\left( v_{ij}\right) -\textrm{Ba}_{k}\left( \left( v_{ij}\right) _{-i}\right) \nonumber \\&\quad \overset{(\text {10}),(\text {5})}{=}\sum _{S\subseteq N\setminus \left\{ i,j,k\right\} }\frac{\left[ v\left( S\cup \left\{ i,j,k\right\} \right) -v\left( S\cup \left\{ i.j\right\} \right) \right] -\left[ v\left( S\cup \left\{ k\right\} \right) -v\left( S\right) \right] }{2^{n-2}} \end{aligned}$$
(14)

and

$$\begin{aligned}&\textrm{Ba}_{k}\left( v\right) -\textrm{Ba}_{k}\left( v_{-i}\right) \nonumber \\&\left. \quad \overset{(\text {10})}{=}\right. \sum _{S\subseteq N\setminus \left\{ i,j,k\right\} }\frac{\left[ v\left( S\cup \left\{ i,k\right\} \right) -v\left( S\cup \left\{ i\right\} \right) \right] -\left[ v\left( S\cup \left\{ k\right\} \right) -v\left( S\right) \right] }{2^{n-1}}\nonumber \\&\left. \qquad +\right. \sum _{S\subseteq N\setminus \left\{ i,j,k\right\} }\frac{\left[ v\left( S\cup \left\{ i,j,k\right\} \right) -v\left( S\cup \left\{ i,j\right\} \right) \right] -\left[ v\left( S\cup \left\{ j,k\right\} \right) -v\left( S\cup \left\{ j\right\} \right) \right] }{2^{n-1}}. \end{aligned}$$
(15)

In the sum of (15) and the analogous expression for j,  the “right” terms cancel out or double up, respectively, and one obtains (14). This shows that \(\textrm{Ba}\) satisfies 22E. \(\square\)

We conclude this section by clarifying the relation between second-order 2-efficiency and 2-efficiency. Second-order 2-efficiency and 2-efficiency do not imply each other. The solution \(\textrm{One}\) in (12) satisfies second-order 2-efficiency but not 2-efficiency. The solution \(\textrm{E}\) for \({\mathbb {V}}\) given by

$$\begin{aligned} \textrm{E}_{i}\left( v\right) \equiv \frac{v\left( N\right) }{2^{n-1} }\qquad \text {for all }N\in {\mathcal {N}}\text {, }v\in {\mathbb {V}}\left( N\right) \text {, and }i\in N, \end{aligned}$$
(16)

satisfies 2-efficiency but not second-order 2-efficiency.

6 Second-order approaches to the Banzhaf value

In this section, we provide our second-order approaches to the Banzhaf value. Based on the second-order properties introduced in the previous section, we provide partial and full second-order characterizations of the Banzhaf value. In particular, we replace one or both properties in Theorems 1 and 2 with their second-order versions, respectively.

6.1 Partial second-order approaches with 2-efficiency

Theorems 1 and 2 remain true if one replaces standardness for two-player games with second-order standardness for two-player games or the dummy player property with the second-order dummy player property, respectively. This indicates that the Banzhaf value is the unique 2-efficient solution that reflects the players’ second-order productivities.

Theorem 7

  1. (i)

    The Banzhaf value is the unique solution for \({\mathbb {V}}\) that satisfies second-order standardness for two-player games (2ST2) and 2-efficiency (2E).

  2. (ii)

    The Banzhaf value is the unique solution for \({\mathbb {V}}\) that satisfies the second-order dummy player property (2D) and 2-efficiency (2E).

These characterizations are non-redundant. The solution \(\textrm{Two}\) in (8) satisfies second-order standardness but not 2-efficiency. The solution \(\textrm{E}\) in (16) satisfies 2-efficiency but not second-order standardness. The Shapley value satisfies the second-order dummy player property but not 2-efficiency. The solution \(\textrm{Zero}\) for \({\mathbb {V}},\) given by

$$\begin{aligned} \textrm{Zero}_{i}\left( v\right) \equiv 0\qquad \text {for all }N\in {\mathcal {N}},\text { }v\in {\mathbb {V}}\left( N\right) ,\text { and }i\in N \end{aligned}$$

satisfies 2-efficiency but not the second-order dummy player property.

We prepare the proof of the theorem by a lemma.

Lemma 8

  1. (i)

    If a solution for \({\mathbb {V}}\) satisfies second-order standardness for two-player games (2ST2) and 2-efficiency (2E), then it satisfies standardness for two player games (ST2).

  2. (ii)

    If a solution for \({\mathbb {V}}\) satisfies the second-order dummy player property (2D) and 2-efficiency (2E), then it satisfies standardness for two player games (ST2).

Proof

(i) Let the solution \(\varphi\) for \({\mathbb {V}}\) satisfy 2ST2 and 2E. Fix \(i,j\in {\mathfrak {U}},\) \(i\ne j.\) First, we have

$$\begin{aligned} \varphi _{i}\left( {\textbf{0}}^{\left\{ i,j\right\} }\right) \overset{{{\textbf {2ST2}}}}{=}\varphi _{i}\left( {\textbf{0}}^{\left\{ i\right\} }\right) \overset{{{\textbf {2E}}}}{=}\varphi _{i}\left( {\textbf{0}} ^{\left\{ i,j\right\} }\right) +\varphi _{j}\left( {\textbf{0}}^{\left\{ i,j\right\} }\right) . \end{aligned}$$

This implies (a) \(\varphi _{j}\left( {\textbf{0}}^{\left\{ j\right\} }\right) =0.\) Analogously, we obtain (b) \(\varphi _{i}\left( {\textbf{0}}^{\left\{ i\right\} }\right) =0.\) Second, for all \(\alpha \in {\mathbb {R}}\), we have

$$\begin{aligned} \varphi _{i}\left( \alpha \cdot u_{\left\{ i,j\right\} }^{\left\{ i,j\right\} }\right) \overset{\text {(b)}}{=}\varphi _{i}\left( \alpha \cdot u_{\left\{ i,j\right\} }^{\left\{ i,j\right\} }\right) -\varphi _{i}\left( {\textbf{0}}^{\left\{ i\right\} }\right) \overset{{{\textbf {2ST2}}}}{=}\frac{\alpha }{2}\overset{{{\textbf {2ST2}},\text {(b)}}}{=}\varphi _{j}\left( \alpha \cdot u_{\left\{ i,j\right\} }^{\left\{ i,j\right\} }\right) \end{aligned}$$
(17)

and

$$\begin{aligned} \varphi _{i}\left( \alpha \cdot u_{\left\{ i\right\} }^{\left\{ i\right\} }\right) \overset{{{\textbf {2E}}}}{=}\varphi _{i}\left( \alpha \cdot u_{\left\{ i,j\right\} }^{\left\{ i,j\right\} }\right) +\varphi _{j}\left( \alpha \cdot u_{\left\{ i,j\right\} }^{\left\{ i,j\right\} }\right) \overset{(\text {17})}{=}\alpha . \end{aligned}$$
(18)

Finally, for all \(v\in {\mathbb {V}}\left( \left\{ i,j\right\} \right)\), we have

$$\begin{aligned} \varphi _{i}\left( v\right) \overset{{{\textbf {2ST2}}}}{=}\frac{\lambda _{\left\{ i,j\right\} }\left( v\right) }{2}+\varphi _{i}\left( \lambda _{\left\{ i\right\} }\left( v\right) \cdot u_{\left\{ i\right\} }^{\left\{ i\right\} }\right) \overset{(\text {18})}{=}\frac{\lambda _{\left\{ i,j\right\} }\left( v\right) }{2}+\lambda _{\left\{ i\right\} }\left( v\right) , \end{aligned}$$

which concludes the proof of part (i).

(ii) Let the solution \(\varphi\) for \({\mathbb {V}}\) satisfy 2D and 2E. Fix \(i,j\in {\mathfrak {U}},\) \(i\ne j.\) First, we have

$$\begin{aligned} \varphi _{i}\left( {\textbf{0}}^{\left\{ i\right\} }\right) \overset{{{\textbf {2E}}}}{=}\varphi _{i}\left( {\textbf{0}}^{\left\{ i,j\right\} }\right) +\varphi _{j}\left( {\textbf{0}}^{\left\{ i,j\right\} }\right) \overset{{{\textbf {2D}}}}{=}\varphi _{i}\left( {\textbf{0}}^{\left\{ i\right\} }\right) +\varphi _{j}\left( {\textbf{0}}^{\left\{ j\right\} }\right) . \end{aligned}$$

This implies (c) \(\varphi _{j}\left( {\textbf{0}}^{\left\{ j\right\} }\right) =0.\) Analogously, we obtain (d) \(\varphi _{i}\left( {\textbf{0}}^{\left\{ i\right\} }\right) =0.\) Second, for all \(\alpha \in {\mathbb {R}}\), we have

$$\begin{aligned} \varphi _{i}\left( \alpha \cdot u_{\left\{ i\right\} }^{\left\{ i\right\} }\right) \overset{{{\textbf {2E}}}}{=}\varphi _{i}\left( \alpha \cdot u_{\left\{ i,j\right\} }^{\left\{ i,j\right\} }\right) +\varphi _{j}\left( \alpha \cdot u_{\left\{ i,j\right\} }^{\left\{ i,j\right\} }\right) \overset{{{\textbf {2D}}}}{=}\alpha +\varphi _{i}\left( {\textbf{0}}^{\left\{ i\right\} }\right) +\varphi _{j}\left( {\textbf{0}} ^{\left\{ j\right\} }\right) \overset{\text {(c),(d)}}{=}\alpha . \end{aligned}$$
(19)

Finally, for all \(v\in {\mathbb {V}}\left( \left\{ i,j\right\} \right)\), we have

$$\begin{aligned} \varphi _{i}\left( v\right) \overset{{{\textbf {2D}}}}{=}\frac{\lambda _{\left\{ i,j\right\} }\left( v\right) }{2}+\varphi _{i}\left( \lambda _{\left\{ i\right\} }\left( v\right) \cdot u_{\left\{ i\right\} }^{\left\{ i\right\} }\right) \overset{(\text {19})}{=} \frac{\lambda _{\left\{ i,j\right\} }\left( v\right) }{2}+\lambda _{\left\{ i\right\} }\left( v\right) , \end{aligned}$$

which concludes the proof of part (ii). \(\square\)

Proof of Theorem 7

Existence: By Remark 3 and Lemma 5, the Banzhaf value satisfies 2ST2 and 2D. By Lehrer (1988, Remark 3), it satisfies 2E. Uniqueness: Let \(\varphi\) be a solution for \({\mathbb {V}}\) that satisfies 2ST2 or 2D and 2E. By Lemma 8, the solution \(\varphi\) satisfies ST. By Lehrer (1988, Remark 3), the solution \(\varphi\) coincides with the Banzhaf value. \(\square\)

Remark 9

Lemma 8 and Theorem 7 hold true within the classes of simple games, of superadditive games, and of simple superadditive games. Both the amalgamation of players and the standard removal of players from a game yields simple games from simple games and superadditive games from superadditive games. Hence, the proofs of Lemma 8, Lehrer (1988, Remark 3), and Theorem 12 work within these classes, respectively.

6.2 Partial second-order approaches with second-order 2-efficiency

Theorems 1 and 2 do not remain true if one replaces 2-efficiency with second-order 2-efficiency (see the non-redundancy argument below). Adding standardness for one-player games to the list of properties yields a characterization of the Banzhaf value.Footnote 13 Cum grano salis, this indicates that the Banzhaf value is the unique second-order 2-efficient solution that reflects the players’ productivities.

Standardness for one-player games, ST1. For all \(i\in {\mathfrak {U}}\) and \(v\in {\mathbb {V}}\left( \left\{ i\right\} \right) ,\) we have \(\varphi _{i}\left( v\right) =v\left( \left\{ i\right\} \right) \overset{(\text {2})}{=}\lambda _{\left\{ i\right\} }\left( v\right) .\)

Theorem 10

The Banzhaf value is the unique solution for \({\mathbb {V}}\) that satisfies standardness for one-player games (ST1), standardness for two-player games (ST2), and second-order 2-efficiency (22E).

This characterization is non-redundant. The Shapley value satisfies all properties but second-order 2-efficiency. The solution \(\textrm{One}\) in (12) satisfies all properties but standardness for two-player games. The solution \(\textrm{Ba}^{0}\) for \({\mathbb {V}}\) given by

$$\begin{aligned} \textrm{Ba}_{i}^{0}\left( v\right) \equiv \left\{ \begin{array}{ll} \textrm{Ba}_{i}\left( v\right) , &{} n>1,\\ 0, &{} n=1 \end{array} \right. \qquad \text {for all }N\in {\mathcal {N}},\text { }v\in {\mathbb {V}}\left( N\right) ,\text { and }i\in N \end{aligned}$$

satisfies all properties but standardness for one-player games.

Proof

Existence: By (4), the Banzhaf value trivially ST1 and ST2. By Remark 3, it satisfies 22E.

Uniqueness: Let the solutions \(\varphi\) and \(\psi\) for \({\mathbb {V}}\) satisfy ST1, ST2, and 22E. We show \(\varphi =\psi\) by induction on n.

Induction basis: For \(n\le 2,\) the claim is immediate from ST1 and ST2.

Induction hypothesis (IH): Suppose \(\varphi \left( v\right) =\psi \left( v\right)\) for all \(N\in {\mathcal {N}}\) and \(v\in {\mathbb {V}}\left( N\right)\) such that \(n\le \theta .\)

Induction step: Let now \(N\in {\mathcal {N}}\) and \(v\in {\mathbb {V}}\left( N\right)\) be such that \(n=\theta +1\ge 3.\) For \(i\in N\) choose \(j,k\in N{\setminus }\left\{ i\right\} ,\) \(j\ne k.\) Now, we have

$$\begin{aligned} 2\cdot \varphi _{i}\left( v\right)&\overset{{{\textbf {22E}}}}{=} \varphi _{i}\left( v_{jk}\right) -\varphi _{i}\left( \left( v_{jk}\right) _{-j}\right) +\varphi _{i}\left( v_{-j}\right) +\varphi _{i}\left( v_{-k}\right) \\&\overset{{IH }}{=}\psi _{i}\left( v_{jk}\right) -\psi _{i}\left( \left( v_{jk}\right) _{-j}\right) +\psi _{i}\left( v_{-j}\right) +\psi _{i}\left( v_{-k}\right) \overset{{{\textbf {22E}}} }{=}2\cdot \psi _{i}\left( v\right) , \end{aligned}$$

which concludes the proof. \(\square\)

Theorem 2 does not remain true if one replaces 2-efficiency with second-order 2-efficiency even if one adds standardness for one-player games. The solution \(\textrm{One}\) in (12) satisfies standardness for one-player games, the dummy player property, and second-order 2-efficiency.

Remark 11

Theorem 10 holds true within the classes of simple games, of superadditive games, and of simple superadditive games. The reasoning is as in Remark 9.

6.3 Full second-order approaches

Replacing both properties in Theorems 1 and 2 with their second-order counterparts does not yield characterizations of the Banzhaf value (see the non-redundancy argument below). Adding standardness for one-player games to the list of properties yields a characterization of the Banzhaf value. Cum grano salis, this indicates that the Banzhaf value is the unique second-order 2-efficient solution that reflects the players’ second-order productivities.

Theorem 12

The Banzhaf value is the unique solution for \({\mathbb {V}}\) that satisfies standardness for one-player games (ST1), [second-order standardness for two-player games (2ST2) or the second-order dummy player property (2D)], and second-order 2-efficiency (22E).

These characterizations are non-redundant. The Shapley value satisfies all properties but second-order 2-efficiency. The solution \(\textrm{One}\) in (12) satisfies all properties but second-order standardness for two-player games and the second-order dummy player property. The solution \(\textrm{Ba}^{+1}\) in (13) satisfies all properties but standardness for one-player games.

We prepare the proof of the theorem by a lemma.

Lemma 13

If a solution for \({\mathbb {V}}\) satisfies standardness for one-player games (ST1) and [second-order standardness for two-player games (2ST2) or the second-order dummy player property (2D)], then it satisfies standardness for two-player games (ST2).

Proof

Let the solution \(\varphi\) for \({\mathbb {V}}\) satisfy ST1 and [2ST2 or 2D]. Let \(i,j\in {\mathfrak {U}},\) \(i\ne j,\) and \(v\in {\mathbb {V}}\left( \left\{ i,j\right\} \right) .\) Trivially, players i and j are second-order dummies to each other in v. Hence, we obtain

$$\begin{aligned} \varphi _{i}\left( v\right) \overset{{{\textbf {2ST2}}\text { or } {\textbf {2D}}}}{=}\frac{\lambda _{\left\{ i,j\right\} }\left( v\right) }{2}+\varphi _{i}\left( v_{-j}\right) \overset{{{\textbf {ST1}}}}{=}\frac{\lambda _{\left\{ i,j\right\} }\left( v\right) }{2}+\lambda _{\left\{ i\right\} }\left( v\right) , \end{aligned}$$

which concludes the proof. \(\square\)

Proof of Theorem 12

Existence: By (4), the Banzhaf value trivially satisfies ST1. By Remark 3 and Lemmas 5 and 6, it satisfies 2ST2, 2D, and 22E.

Uniqueness: Let \(\varphi\) and \(\psi\) be solutions for \({\mathbb {V}}\) that satisfy ST1, [2ST2 or 2D], and 22E. We show \(\varphi =\psi\) by induction on n.

Induction basis: For \(n=1,\) the claim is immediate from ST1. For \(n=2,\) the claim follows from ST1, [2ST2 or 2D], and Lemma 13.

Induction hypothesis (IH): Suppose \(\varphi \left( v\right) =\psi \left( v\right)\) for all \(N\in {\mathcal {N}}\) and \(v\in {\mathbb {V}}\left( N\right)\) such that \(n\le \theta .\)

Induction step: As in the proof of Theorem 10. \(\square\)

Remark 14

Lemma 13 and Theorem 12 hold true within the classes of simple games, of superadditive games, and of simple superadditive games. The reasoning is as in Remark 9.

7 Concluding remarks

In this paper, we suggest a number of characterizations of the Banzhaf value indicating that the latter is the unique (second-order) 2-efficient solution that reflects the players’ (second-order) productivities in terms of their second-order payoffs. Casajus (2020, Appendix A) suggests and discusses higher-order marginal contributions and higher-order payoffs and related properties of solutions, higher-order symmetry and higher-order marginality, with respect to the Shapley value. Whereas the Shapley value satisfies these higher-order properties, it is not the unique efficient solution that satisfies these higher-order properties.

For higher-order versions of the characterizations in this paper, there would be additional difficulties. Second-order standardness for two-player games and the second-order dummy player property refer to the players’ standard payoffs in one-player games and in two-player games. For games with three and more players, there are no standard payoffs. Hence, there is not even a unique or standard way to define higher-order versions of standardness for games with more than two players and the dummy player property.