We study the efficient computation of power indices for weighted voting games using the paradigm of dynamic programming. We survey the state-of-the-art algorithms for computing the Banzhaf and Shapley-Shubik indices and point out how these approaches carry over to related power indices. Within a unified framework, we present new efficient algorithms for the Public Good index and a recently proposed power index based on minimal winning coalitions of the smallest size, as well as a very first method for computing the Johnston indices for weighted voting games efficiently. We introduce a software package providing fast C++ implementations of all the power indices mentioned in this article, discuss computing times, as well as storage requirements.

Computing Shapley values for large cooperative games is an NP-hard problem. For practical applications, stochastic approximation via permutation sampling is widely used. In the context of machine learning applications of the Shapley value, the concept of antithetic sampling has become popular. The idea is to employ the reverse permutation of a sample in order to reduce variance and accelerate convergence of the algorithm. We study this approach for the Shapley and Banzhaf values, as well as for the Owen value which is a solution concept for games with precoalitions. We combine antithetic samples with established stratified sampling algorithms. Finally, we evaluate the performance of these algorithms on four different types of cooperative games.

This paper reviews the recent literature on the “social ranking problem”, that is, the problem of converting group rankings into individual rankings. We introduce and categorize existing social ranking methods and we briefly explain their attributes. Three main categories of social ranking methods are identified: lexicographic social rankings, methods based on voting mechanisms, and those inspired by the theory of coalitional games. An open-source R package called socialranking for computing the majority of the existing social rankings is also presented and discussed.

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and Shapley–Shubik indices for weighted voting games, we present a framework for fast algorithms for the three most common power indices with precoalitions, i.e., the Owen index, the Banzhaf–Owen index and the symmetric coalitional Banzhaf index, and point out why our new algorithms are applicable for large numbers of players. We discuss implementations of our algorithms for the three power indices with precoalitions in C++ and review computing times, as well as storage requirements.

The aim of the article is to propose a new method of valuation of a company, considering its ownership relations with other companies. For this purpose, the concept of the Shapley value from cooperative game theory is used as the basis for assessing such dependent companies. The paper presents proposals for Shapley value calculation algorithms for our model. We expand our model by discussing personal relations in addition to ownership relations and point out how intuitionistic fuzzy sets may be helpful in this context. As a result, we propose two new expanded models. In the first probabilistic model, we apply Pearson’s correlation coefficient, in the second, we use a correlation coefficient between intuitionistic fuzzy sets to determine the personal relationships. Finally, we present and interpret results for a real-world economic network with 17 companies.