Zack Fitzsimmons

Orcid: 0000-0001-5147-9646

Affiliations:
  • College of the Holy Cross, Worcester, MA, USA
  • Rochester Institute of Technology, NY, USA (former)


According to our database1, Zack Fitzsimmons authored at least 20 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Hardness of Fair Allocation under Ternary Valuations.
CoRR, 2024

2023
Complexity of Conformant Election Manipulation.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022
Insight into Voting Problem Complexity Using Randomized Classes.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Kemeny Consensus Complexity.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Representative Proxy Voting.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Incomplete Preferences in Single-Peaked Electorates.
J. Artif. Intell. Res., 2020

Correction to: Control in the presence of manipulators: cooperative and competitive cases.
Auton. Agents Multi Agent Syst., 2020

Control in the presence of manipulators: cooperative and competitive cases.
Auton. Agents Multi Agent Syst., 2020

Selecting Voting Locations for Fun and Profit.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Election Score Can Be Harder than Winner.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
High-multiplicity election problems.
Auton. Agents Multi Agent Syst., 2019

Very Hard Electoral Control Problems.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2017
The Complexity of Succinct Elections.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Manipulation Complexity of Same-System Runoff Elections.
Ann. Math. Artif. Intell., 2016

Modeling Single-Peakedness for Votes with Ties.
Proceedings of the STAIRS 2016, 2016

2015
Single-Peaked Consistency for Weak Orders Is Easy.
Proceedings of the Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2015

Complexity of Manipulative Actions When Voting with Ties.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Realistic Assumptions for Attacks on Elections.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013
X THEN X: Manipulation of Same-System Runoff Elections
CoRR, 2013


  Loading...