122 citations · 409 across the 73 of their papers we have counts for
Showing cs.CCShow all
3 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.CC2006
The Consequences of Eliminating NP Solutions
Piotr Faliszewski, Lane A. Hemaspaandra
Given a function based on the computation of an NP machine, can one in general eliminate some solutions? That is, can one in general decrease the ambiguity? This simple question re…
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…