Follow
Zack Fitzsimmons
Zack Fitzsimmons
Associate Professor, College of the Holy Cross
Verified email at holycross.edu - Homepage
Title
Cited by
Cited by
Year
Efficient FPGA implementation of steerable Gaussian smoothers
A Joginipelly, A Varela, D Charalampidis, R Schott, Z Fitzsimmons
Proceedings of the 2012 44th Southeastern Symposium on System Theory (SSST†…, 2012
312012
Incomplete preferences in single-peaked electorates
Z Fitzsimmons, M Lackner
Journal of Artificial Intelligence Research 67, 797-833, 2020
182020
Single-Peaked Consistency for Weak Orders Is Easy
Z Fitzsimmons
Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge†…, 2015
172015
Control in the Presence of Manipulators: Cooperative and Competitive Cases
Z Fitzsimmons, E Hemaspaandra, LA Hemaspaandra
Twenty-Third International Joint Conference on Artificial Intelligence, 113-119, 2013
152013
Complexity of manipulative actions when voting with ties
Z Fitzsimmons, E Hemaspaandra
Algorithmic Decision Theory: 4th International Conference, ADT 2015†…, 2015
142015
Modeling Single-Peakedness for Votes with Ties
Z Fitzsimmons, E Hemaspaandra
STAIRS 2016: Proceedings of the Eighth European Starting AI Researcher†…, 2016
92016
Representative proxy voting
E Anshelevich, Z Fitzsimmons, R Vaish, L Xia
Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5086-5093, 2021
82021
Manipulation complexity of same-system runoff elections
Z Fitzsimmons, E Hemaspaandra, LA Hemaspaandra
Annals of Mathematics and Artificial Intelligence 77, 159-189, 2016
7*2016
Selecting voting locations for fun and profit
Z Fitzsimmons, O Lev
arXiv preprint arXiv:2003.06879, 2020
62020
High-multiplicity election problems
Z Fitzsimmons, E Hemaspaandra
Autonomous Agents and Multi-Agent Systems 33, 383-402, 2019
62019
Insight into voting problem complexity using randomized classes
Z Fitzsimmons, E Hemaspaandra
arXiv preprint arXiv:2204.12856, 2022
52022
Very hard electoral control problems
Z Fitzsimmons, E Hemaspaandra, A Hoover, DE NarvŠez
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1933-1940, 2019
52019
Election score can be harder than winner
Z Fitzsimmons, E Hemaspaandra
ECAI 2020, 83-90, 2020
42020
The Complexity of Succinct Elections
Z Fitzsimmons, E Hemaspaandra
Thirty-First AAAI Conference on Artificial Intelligence, 2017
42017
Kemeny consensus complexity
Z Fitzsimmons, E Hemaspaandra
arXiv preprint arXiv:2105.08540, 2021
32021
Using weighted matching to solve 2-approval/veto control and bribery
Z Fitzsimmons, E Hemaspaandra
ECAI 2023, 732-739, 2023
12023
Control in the presence of manipulators: cooperative and competitive cases
Z Fitzsimmons, E Hemaspaandra, LA Hemaspaandra
Autonomous Agents and Multi-Agent Systems 34 (2), 52, 2020
12020
On the Hardness of Fair Allocation under Ternary Valuations
Z Fitzsimmons, V Viswanathan, Y Zick
arXiv preprint arXiv:2403.00943, 2024
2024
Complexity of conformant election manipulation
Z Fitzsimmons, E Hemaspaandra
International Symposium on Fundamentals of Computation Theory, 176-189, 2023
2023
Incomplete Preferences in Single-Peaked Electorates
M Lackner, Z Fitzsimmons
Artificial Intelligence 67, 797-833, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20