20 citations · 206 across the 49 of their papers we have counts for
64 papers
On the Parallelizability of Approval-Based Committee Rules
Zack Fitzsimmons, Zohair Raza Hassan, Edith Hemaspaandra
Approval-Based Committee (ABC) rules are an important tool for choosing a fair set of candidates when given the preferences of a collection of voters. Though finding a winning comm…
Complexity of Conformant Election Manipulation
Zack Fitzsimmons, Edith Hemaspaandra
It is important to study how strategic agents can affect the outcome of an election. There has been a long line of research in the computational study of elections on the complexit…
The Complexity of -Arrowing
Zohair Raza Hassan, Edith Hemaspaandra, Stanisław Radziszowski
For fixed nonnegative integers and , the -Arrowing problem asks whether a given graph, , has a red/blue coloring of such that there are no red co…
Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery
Zack Fitzsimmons, Edith Hemaspaandra
Determining the complexity of election attack problems is a major research direction in the computational study of voting problems. The paper "Towards completing the puzzle: comple…
Insight into Voting Problem Complexity Using Randomized Classes
Zack Fitzsimmons, Edith Hemaspaandra
The first step in classifying the complexity of an NP problem is typically showing the problem in P or NP-complete. This has been a successful first step for many problems, includi…
Kemeny Consensus Complexity
Zack Fitzsimmons, Edith Hemaspaandra
The computational study of election problems generally focuses on questions related to the winner or set of winners of an election. But social preference functions such as Kemeny r…