20 citations · 74 across the 17 of their papers we have counts for
5 papers · 1 filter
A Richer Understanding of the Complexity of Election Systems
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1
We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control pr…
How Hard Is Bribery in Elections?
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voters…
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe
Electoral control refers to attempts by an election's organizer ("the chair") to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreaking work…
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…
Query-Monotonic Turing Reductions
Lane A. Hemaspaandra, Mayur Thakur
We study reductions that limit the extreme adaptivity of Turing reductions. In particular, we study reductions that make a rapid, structured progression through the set to which th…