Pyramidal values

Abstract

We propose and analyze a new type of values for cooperative TU-games, which we call pyramidal values. Assuming that the grand coalition is sequentially formed, and all orderings are equally likely, we define a pyramidal value to be any expected payoff in which the entrant player receives a salary, and the rest of his marginal contribution to the just formed coalition is distributed among the incumbent players. We relate the pyramidal-type sharing scheme we propose with other sharing schemes, and we also obtain some known values by means of this kind of pyramidal procedures. In particular, we show that the Shapley value can be obtained by means of an interesting pyramidal procedure that distributes nonzero dividends among the incumbents. As a result, we obtain an alternative formulation of the Shapley value based on a measure of complementarity between two players. Finally, we introduce the family of proportional pyramidal values, in which an incumbent receives a dividend in proportion to his initial investment, measured by means of his marginal contribution.

This is a preview of subscription content, access via your institution.

Notes

  1. 1.

    In the sequel, for convenience, we will write singleton {i} just as i.

  2. 2.

    Note that these dividends are not the same as the well-known Harsanyi dividends, which are associated to coalitions, not only to agents.

  3. 3.

    Those negative shares can be interpreted as investments on human capital.

  4. 4.

    This concept was implicitly first considered by Owen (1972) who defined the co-value q ij (v) of i and j. The interaction index (11) differs from Owen’s co-value in the number of orders in which \(\Delta_{ij}^{2} (S)\) is considered. Owen’s co-value takes into account only those orders in which i, S players, and j arrive in the first places.

References

  1. Béal, S., Rémila, E., & Solal, P. (2012). Compensations in the Shapley value and the compensation solutions for graph games. International Journal of Game Theory, 41, 157–178.

    Article  Google Scholar 

  2. Casajus, A., & Huettner, F. (2013). Null players, solidarity, and the egalitarian Shapley values. Journal of Mathematical Economics, 49, 58–61.

    Article  Google Scholar 

  3. Castro, J., Gomez, D., & Tejada, J. (2009). Polynomial calculation of the Shapley value based on sampling. Computers and Operations Research, 36, 1726–1730.

    Article  Google Scholar 

  4. Derks, J. J. M., & Haller, H. H. (1999). Null players out? Linear values for games with variable supports. International Game Theory Review, 1, 301–314.

    Article  Google Scholar 

  5. Grabisch, M., & Roubens, M. (1999). An axiomatic approach to the concept of interaction among players in cooperative games. International Journal of Game Theory, 28, 547–565.

    Article  Google Scholar 

  6. Ichiisi, T. (1981). Super-modularity: applications to convex games and to the greedy algorithm for LP. Journal of Economic Theory, 25, 283–286.

    Article  Google Scholar 

  7. Joosten, R. (1996). Dynamics, equilibria and values. Dissertation, Maastricht University.

  8. Ju, Y., Borm, P., & Ruys, P. (2007). The consensus value: a new solution concept for cooperative games. Social Choice and Welfare, 28, 685–703.

    Article  Google Scholar 

  9. Kalai, E., & Samet, D. (1987). On weighted Shapley values. International Journal of Game Theory, 16, 205–222.

    Article  Google Scholar 

  10. Malawski, M. (2013). “Procedural” values for cooperative games. International Journal of Game Theory, 42, 305–324.

    Article  Google Scholar 

  11. Maschler, M., & Peleg, B. (1966). A characterization, existence proof and dimension bounds for the kernel of a game. Pacific Journal of Mathematics, 18, 289–328.

    Article  Google Scholar 

  12. Myerson, R. B. (1977). Graphs and cooperation in games. Mathematics of Operations Research, 2, 225–229.

    Article  Google Scholar 

  13. Owen, G. (1972). Multilinear extensions of games. Management Sciences, 18, 64–79.

    Article  Google Scholar 

  14. Segal, I. (2003). Collusion, exclusion and inclusion in random-order bargaining. Review of Economic Studies, 70, 439–460.

    Article  Google Scholar 

  15. Shapley, L. S. (1953). A value for n-person games. In Contributions to the theory of games II, pp. 307–317.

  16. van den Brink, R., Funaki, Y., & Ju, Y. (2013). Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values. Social Choice and Welfare, 40, 693–714.

    Article  Google Scholar 

  17. Weber, R. J. (1988). Probabilistic values for games. In A. Roth (Ed.), The Shapley value: Essays in honor of Lloyd S. Shapley (pp. 101–119). Cambridge: Cambridge University Press.

    Google Scholar 

  18. Young, H. P. (1985). Monotonic solutions of cooperative games. International Journal of Game Theory, 14, 65–72.

    Article  Google Scholar 

Download references

Acknowledgements

We would like to warmly thank the referees for their careful reports, that definitely improved the quality of our paper and made it much more readable and interesting.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Elisenda Molina.

Additional information

This research has been supported by I+D+i research project MTM2011-27892 from the Government of Spain.

Appendix

Appendix

In this appendix we collect the formal definitions of all the known values analyzed in Sect. 3, as well as the characterization results we have used.

Theorem 1

(Shapley 1953)

There exists a unique value satisfying the efficiency, symmetry, dummy, and additivity axioms. It is the Shapley value, which is defined for every (N,v)∈G n as follows:

$$ \displaystyle \phi_i (N,v) = \sum_{\substack{S\subseteq N\\ i \notin S}} \frac{s!(n-s-1)!}{n!} \bigl( v(S\cup\{ i\}) - v(S) \bigr), \quad i=1,\dots,n, $$
(19)

where s=|S| denotes the cardinality of coalition SN.

The Consensus value (Ju et al. 2007) is aimed to generalize the standard solution for 2-person TU games into n-person cases. It is based on a two-sided negotiation process that can be understood as a standardized remainder rule described by the following vectors. The reader is referred to Ju et al. (2007) for a detailed exposition of this rule.

Definition 6

(Ju, Borm and Ruys 2007)

Let (N,v)∈G n , and πΠ(N) be a given permutation. Define \(S_{k}^{\pi}=\{ \pi^{-1}(1),\dots, \pi^{-1}(k)\}\subseteq N\) and \(S_{0}^{\pi }=\emptyset\). Then, the standardized remainder for coalition \(S_{k}^{\pi }\), \(r(S_{k}^{\pi})\), is recursively defined as follows:

$$r(S_k^{\pi})= \begin{cases} v(N), & \text{ if $k=n$,} \\ v(S_k^{\pi})+\frac{1}{2} (r(S_{k+1}^{\pi}) - v(S_k^{\pi}) - v(\{ \pi^{-1} (k+1)\}) ), & \text{ if $k\in\{1,\dots,n-1\}$.} \end{cases} $$

\(r(S_{k}^{\pi})\) is the value left for \(S_{k}^{\pi}\) after allocating surpluses to earlier leavers \(N\setminus S_{k}^{\pi}\). Then, the standardized remainder vector, sr π(v), which corresponds to the situation where the players leave the game one by one in the order (π −1(n),…,π −1(1)), is defined recursively by:

$$sr_{\pi^{-1}(k)}= \begin{cases} v(\{ \pi^{-1} (k)\}) + \frac{1}{2} (r(S_{k}^{\pi}) - v(S_{k-1}^{\pi}) - v(\{ \pi^{-1} (k)\}) ), & \text{ if $k\in\{ 2,\dots,n\}$,} \\ r(S_1^{\pi}) , & \text{ if $k=1$.} \end{cases} $$

Definition 7

(Ju, Borm and Ruys 2007)

For every (N,v)∈G n , the consensus value Ψ(v) is defined as the average, over the set of all permutation Π(N), of the individual standardized remainder vectors, i.e.,

$$\varPsi(v)=\frac{1}{n!} \sum_{\pi\in\varPi(N)} sr^{\pi} (v). $$

Definition 8

(Ju, Borm and Ruys 2007)

For every (N,v)∈G n and α∈[0,1], the α-consensus value Ψ α(v) is defined as the average, over the set of all permutation Π(N), of the individual α-remainder vectors, i.e.,

$$\varPsi^{\alpha}(v)=\frac{1}{n!} \sum_{\pi\in\varPi(N)} (sr^{\pi})^{\alpha} (v). $$

Here, the α-remainder \(r^{\alpha}(S_{k}^{\pi})\) and the individual α-remainder vector (sr π)α(v) are defined as follows:

$$r^{\alpha}(S_k^{\pi})= \begin{cases} v(N), & \text{ if $k=n$,} \\ v(S_k^{\pi})+ (1-\alpha) (r^{\alpha}(S_{k+1}^{\pi}) - v(S_k^{\pi }) - v(\{ \pi^{-1} (k+1)\}) ), & \text{ if $k\in\{1,\dots,n-1\}$.} \end{cases} $$

and

$$(sr_{\pi^{-1}(k)})^{\alpha}= \begin{cases} v(\{ \pi^{-1} (k)\}) + \alpha (r^{\alpha}(S_{k}^{\pi }) - v(S_{k-1}^{\pi}) - v(\{ \pi^{-1} (k)\}) ), & \text{ if $k\in \{2,\dots,n\}$,} \\ r^{\alpha}(S_1^{\pi}) , & \text{ if $k=1$.} \end{cases} $$

The authors introduce the following property in order to characterize the family of consensus values. The next theorem corresponds to Theorem 5 in Ju, Borm and Ruys (2007). We make use of (a) characterization.

Definition 9

(Ju, Borm and Ruys 2007)

A value \(\varphi: G_{n}\rightarrow\mathbb{R}^{n}\) verifies the α-dummy property if \(\varphi_{i}(v)=\alpha v(i) + (1-\alpha) ( v(i) + \frac{v(N)-\sum_{j\in N} v(j)}{n} )\), for all (N,v)∈G n , and every dummy player iN with respect to v.

Theorem 2

(Ju, Borm and Ruys 2007)

  1. (a)

    The α-consensus value Ψ α is the unique one-point solution concept on G n that satisfies efficiency, symmetry, the α-dummy property and additivity.

  2. (b)

    The α-consensus value Ψ α is the unique function that satisfies efficiency, symmetry, the α-dummy property and the transfer property over the class of TU games.

  3. (c)

    For any vG n , it holds that

    $$\varPsi^{\alpha}(v)=\alpha\alpha\phi(v) + (1-\alpha) E(v), $$

    where E(v) is the equal surplus solution of v, i.e., \(E_{i}(v)=v(i)+\frac{v(N)-\sum_{j\in N} v(j)}{n}\).

  4. (d)

    The α-consensus value Ψ α is the unique function that satisfies efficiency and the α-equal welfare loss property over the class of TU games.

The Egalitarian Shapley values (Joosten 1996) make the trade-off between marginalism and egalitarianism by means of convex combinations of the Shapley value and the equal division solution.

Definition 10

(Joosten 1996)

For every (N,v)∈G n and α∈[0,1], the α-egalitarian Shapley value φ α(v) is given by

$$\varphi^{\alpha}(v)=\alpha\phi(v) + (1-\alpha) ED(v), $$

where ED(v) is the equal division value which distributes the worth v(N) equally among all players: \(ED(v)=(\frac{v(N)}{n},\dots,\frac{v(N)}{n})\).

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Flores, R., Molina, E. & Tejada, J. Pyramidal values. Ann Oper Res 217, 233–252 (2014). https://doi.org/10.1007/s10479-013-1509-y

Download citation

Keywords

  • Game theory
  • TU games
  • Pyramidal values
  • Procedural values
  • Shapley value
  • Co-values
  • Consensus values
  • Egalitarian Shapley values