Generating functions for computing power indices efficiently
From MaRDI portal
Publication:5937139
DOI10.1007/BF02628555zbMath0991.91005OpenAlexW1999646672MaRDI QIDQ5937139
Andrés Jiménez-Losada, Julio R. Fernández, Jésus Mario Bilbao, J. J. López
Publication date: 3 September 2002
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02628555
generating functionsvotingBanzhaf power indexShapley-Shubik power indextime complexityweighted voting games
Related Items
Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players ⋮ Representation-compatible power indices ⋮ Implicit power indices for measuring indirect control in corporate structures ⋮ A linear approximation method for the Shapley value ⋮ Evaluation of Banzhaf index with restrictions on coalitions formation ⋮ Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ Efficient computation of the Shapley value for large-scale linear production games ⋮ Dynamic programming for computing power indices for weighted voting games with precoalitions ⋮ A note on ``Measurement of disproportionality in proportional representation systems ⋮ The complexity of power indexes with graph restricted coalitions ⋮ A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ A new family of regular semivalues and applications ⋮ A generating functions approach for computing the public good index efficiently ⋮ Confidence intervals for the Shapley-Shubik power index in Markovian games ⋮ Minimax Multi-District Apportionments ⋮ Polynomial calculation of the Shapley value based on sampling ⋮ Power indices of simple games and vector-weighted majority games by means of binary decision diagrams ⋮ A stochastic approach to approximate values in cooperative games ⋮ Unnamed Item ⋮ Dynamic programming algorithms for computing power indices in weighted multi-tier games ⋮ The \(cg\)-position value for games on fuzzy communication structures ⋮ An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players ⋮ A Shapley-based Groves mechanism: when the mechanism designer plays the \textit{wise man} ⋮ Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras ⋮ On calculation of the power indices with allowance for the agent preferences ⋮ Voting power on a graph connected political space with an application to decision-making in the council of the European Union ⋮ SOME OPEN PROBLEMS IN SIMPLE GAMES ⋮ Monte Carlo methods for the Shapley-Shubik power index ⋮ Computation of several power indices by generating functions
Uses Software
Cites Work
