20 citations · 87 across the 21 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.GT2023
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…
cs.CC2023
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…
cs.GT2023★ 1 cited
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…