1 citations · 1 across the 2 of their papers we have counts for
7 papers
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…
Representative Proxy Voting
Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish +1
We study a model of proxy voting where the candidates, voters, and proxies are all located on the real line, and instead of voting directly, each voter delegates its vote to the cl…
Selecting Voting Locations for Fun and Profit
Zack Fitzsimmons, Omer Lev
While manipulative attacks on elections have been well-studied, only recently has attention turned to attacks that account for geographic information, which are extremely common in…
Very Hard Electoral Control Problems
Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover +1
It is important to understand how the outcome of an election can be modified by an agent with control over the structure of the election. Electoral control has been studied for man…
Election Score Can Be Harder Than Winner
Zack Fitzsimmons, Edith Hemaspaandra
Election systems based on scores generally determine the winner by computing the score of each candidate and the winner is the candidate with the best score. It would be natural to…
Modeling Single-Peakedness for Votes with Ties
Zack Fitzsimmons, Edith Hemaspaandra
Single-peakedness is one of the most important and well-known domain restrictions on preferences. The computational study of single-peaked electorates has largely been restricted t…