Efficient Computation of Power Indices for Weighted Majority Games
From MaRDI portal
Publication:4909584
DOI10.1007/978-3-642-35261-4_70zbMath1260.91007OpenAlexW119581101MaRDI QIDQ4909584
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_70
(n)-person games, (n>2) (91A06) Voting theory (91B12) Dynamic programming (90C39) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Related Items (10)
Implicit power indices for measuring indirect control in corporate structures ⋮ A fuzzy opportunity and threat aggregation approach in multicriteria decision analysis ⋮ Dynamic programming for computing power indices for weighted voting games with precoalitions ⋮ The complexity of power indexes with graph restricted coalitions ⋮ Power indices of simple games and vector-weighted majority games by means of binary decision diagrams ⋮ Unnamed Item ⋮ Dynamic programming algorithms for computing power indices in weighted multi-tier games ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ Voting power on a graph connected political space with an application to decision-making in the council of the European Union ⋮ Monte Carlo methods for the Shapley-Shubik power index
This page was built for publication: Efficient Computation of Power Indices for Weighted Majority Games
