Faster algorithms for computing power indices in weighted voting games
From MaRDI portal
Publication:1779724
DOI10.1016/j.mathsocsci.2004.06.002zbMath1118.91007OpenAlexW2065168624MaRDI QIDQ1779724
Bettina Klinz, Gerhard J. Woeginger
Publication date: 1 June 2005
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2004.06.002
Related Items
On the use of binary decision diagrams for solving problems on simple games, The complexity of power indexes with graph restricted coalitions, A relation-algebraic approach to simple games, Exact algorithms for problems related to the densest \(k\)-set problem, Confidence intervals for the Shapley-Shubik power index in Markovian games, Open problems around exact algorithms, Power indices of simple games and vector-weighted majority games by means of binary decision diagrams, Variable Influences in Conjunctive Normal Forms, POWER INDICES AND THE MEASUREMENT OF CONTROL IN CORPORATE STRUCTURES, Monte Carlo methods for the Shapley-Shubik power index
Cites Work
