Dynamic programming algorithms for computing power indices in weighted multi-tier games

DOI10.1016/J.MATHSOCSCI.2020.06.004zbMATH Open1505.91048OpenAlexW3036575477MaRDI QIDQ2019337FDOQ2019337

Authors: Ingo Wilms 

Publication date: 26 April 2021

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2020.06.004

Recommendations

• Faster algorithms for computing power indices in weighted voting games
• Efficient Computation of Power Indices for Weighted Majority Games
• Computing power indices in weighted multiple majority games.
• Computation of several power indices by generating functions
• scientific article; zbMATH DE number 1766750

zbMATH Keywords

dynamic programmingbinary decision diagrampower indicesShapley-Shubik indexBanzhaf index

Mathematics Subject Classification ID

Dynamic programming (90C39) Cooperative games (91A12) Voting theory (91B12)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• Computing power indices in weighted multiple majority games.
• On the Theory of Dynamic Programming
• Weighted voting, multicameral representation, and power
• Multilinear Extensions of Games
• On the existence of a minimum integer representation for weighted voting systems
• Weighted multiple majority games with unions: generating functions and applications to the European Union
• A new index of power for simple n-person games
• A three-dimensional voting system in Hong Kong
• Generating functions for computing power indices efficiently
• Assessing success and decisiveness in voting situations
• The distribution of power in the European constitution
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• On the characterization of weighted simple games
• Title not available (Why is that?)
• An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players
• Efficient Computation of Power Indices for Weighted Majority Games
• Three-valued simple games

Cited In (2)

• Efficient Computation of Power Indices for Weighted Majority Games
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams

This page was built for publication: Dynamic programming algorithms for computing power indices in weighted multi-tier games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019337)