The Complexity of Power-Index Comparison

DOI10.1007/978-3-540-68880-8_18MaRDI QIDQ3511427zbMATH OpenOpenAlexFDO

Authors Piotr Faliszewski, Lane A. Hemaspaandra

Publication date 10 July 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1802/5158

zbMATH Keywords

computational complexitypower indicesweighted voting games

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Voting theory (91B12)

Recommendations

• The complexity of power-index comparison
• NP-completeness for calculating power indices of weighted majority games
• scientific article; zbMATH DE number 1766750
• The complexity of power indexes with graph restricted coalitions
• Faster algorithms for computing power indices in weighted voting games

Cited in

(11)

• The complexity of power-index comparison
• Power measures derived from the sequential query process
• Computing power indices: multilinear extensions and new characterizations
• Comparing Computational Power
• Proof systems and transformation games
• Power Indices in Spanning Connectivity Games
• The consequences of eliminating NP solutions
• Computing cooperative solution concepts in coalitional skill games
• The complexity of measuring power in generalized opinion leader decision models
• NP-completeness for calculating power indices of weighted majority games
• The complexity of power indexes with graph restricted coalitions

This page was built for publication: The Complexity of Power-Index Comparison

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