18 citations · 18 across the 2 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2008
The Complexity of Power-Index Comparison
Piotr Faliszewski, Lane A. Hemaspaandra
We study the complexity of the following problem: Given two weighted voting games G' and G'' that each contain a player p, in which of these games is p's power index value higher?…
cs.CC2005
Open Questions in the Theory of Semifeasible Computation
Piotr Faliszewski, Lane A. Hemaspaandra
The study of semifeasible algorithms was initiated by Selman's work a quarter of century ago [Sel79,Sel81,Sel82]. Informally put, this research stream studies the power of those se…