The Complexity of Power-Index Comparison

DOI10.1007/978-3-540-68880-8_18zbMath1143.91321OpenAlexW1570872913MaRDI QIDQ3511427

Piotr Faliszewski, Hemaspaandra, Lane A.

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 complexityweighted voting gamespower indices

Mathematics Subject Classification ID

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

Related Items (4)

Proof systems and transformation games ⋮ The consequences of eliminating NP solutions ⋮ Computing cooperative solution concepts in coalitional skill games ⋮ Power Indices in Spanning Connectivity Games

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