Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZack Fitzsimmons
Person information
- affiliation: College of the Holy Cross, Worcester, MA, USA
- affiliation (former): Rochester Institute of Technology, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j5]Zack Fitzsimmons
, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34(2): 52 (2020)- [j4]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Correction to: Control in the presence of manipulators: cooperative and competitive cases. Auton. Agents Multi Agent Syst. 34(2): 56 (2020) - [j3]Zack Fitzsimmons, Martin Lackner:
Incomplete Preferences in Single-Peaked Electorates. J. Artif. Intell. Res. 67: 797-833 (2020) - 2019
- [j2]Zack Fitzsimmons, Edith Hemaspaandra:
High-multiplicity election problems. Auton. Agents Multi Agent Syst. 33(4): 383-402 (2019) - 2016
- [j1]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Manipulation Complexity of Same-System Runoff Elections. Ann. Math. Artif. Intell. 77(3-4): 159-189 (2016)
Conference and Workshop Papers
- 2023
- [c15]Zack Fitzsimmons, Edith Hemaspaandra:
Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. ECAI 2023: 732-739 - [c14]Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Conformant Election Manipulation. FCT 2023: 176-189 - 2022
- [c13]Zack Fitzsimmons, Edith Hemaspaandra:
Insight into Voting Problem Complexity Using Randomized Classes. IJCAI 2022: 293-299 - 2021
- [c12]Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia:
Representative Proxy Voting. AAAI 2021: 5086-5093 - [c11]Zack Fitzsimmons, Edith Hemaspaandra:
Kemeny Consensus Complexity. IJCAI 2021: 196-202 - 2020
- [c10]Zack Fitzsimmons, Edith Hemaspaandra:
Election Score Can Be Harder than Winner. ECAI 2020: 83-90 - [c9]Zack Fitzsimmons, Omer Lev:
Selecting Voting Locations for Fun and Profit. IJCAI 2020: 224-230 - 2019
- [c8]Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez:
Very Hard Electoral Control Problems. AAAI 2019: 1933-1940 - 2018
- [c7]Zack Fitzsimmons, Edith Hemaspaandra:
High-Multiplicity Election Problems. AAMAS 2018: 1558-1566 - 2017
- [c6]Zack Fitzsimmons, Edith Hemaspaandra:
The Complexity of Succinct Elections. AAAI 2017: 4921-4922 - 2016
- [c5]Zack Fitzsimmons, Edith Hemaspaandra:
Modeling Single-Peakedness for Votes with Ties. STAIRS 2016: 63-74 - 2015
- [c4]Zack Fitzsimmons:
Realistic Assumptions for Attacks on Elections. AAAI 2015: 4135-4236 - [c3]Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Manipulative Actions When Voting with Ties. ADT 2015: 103-119 - [c2]Zack Fitzsimmons:
Single-Peaked Consistency for Weak Orders Is Easy. TARK 2015: 127-140 - 2013
- [c1]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the Presence of Manipulators: Cooperative and Competitive Cases. IJCAI 2013: 113-119
Informal and Other Publications
- 2024
- [i15]Zack Fitzsimmons, Vignesh Viswanathan, Yair Zick:
On the Hardness of Fair Allocation under Ternary Valuations. CoRR abs/2403.00943 (2024) - 2023
- [i14]Zack Fitzsimmons, Edith Hemaspaandra:
Using Weighted Matching to Solve 2-Approval/Veto Control and Bribery. CoRR abs/2305.16889 (2023) - [i13]Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Conformant Election Manipulation. CoRR abs/2307.11689 (2023) - 2022
- [i12]Zack Fitzsimmons, Edith Hemaspaandra:
Insight into Voting Problem Complexity Using Randomized Classes. CoRR abs/2204.12856 (2022) - 2021
- [i11]Zack Fitzsimmons, Edith Hemaspaandra:
Kemeny Consensus Complexity. CoRR abs/2105.08540 (2021) - 2020
- [i10]Zack Fitzsimmons, Omer Lev:
Selecting Voting Locations for Fun and Profit. CoRR abs/2003.06879 (2020) - [i9]Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia:
Representative Proxy Voting. CoRR abs/2012.06747 (2020) - 2019
- [i8]Zack Fitzsimmons, Martin Lackner:
Incomplete Preferences in Single-Peaked Electorates. CoRR abs/1907.00752 (2019) - 2018
- [i7]Zack Fitzsimmons, Edith Hemaspaandra:
Election Score Can Be Harder Than Winner. CoRR abs/1806.08763 (2018) - [i6]Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez:
Very Hard Electoral Control Problems. CoRR abs/1811.05438 (2018) - 2016
- [i5]Zack Fitzsimmons, Edith Hemaspaandra:
Modeling Single-Peakedness for Votes with Ties. CoRR abs/1604.08191 (2016) - [i4]Zack Fitzsimmons, Edith Hemaspaandra:
The Complexity of Succinct Elections. CoRR abs/1611.08927 (2016) - 2015
- [i3]Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Manipulative Actions When Voting with Ties. CoRR abs/1506.04722 (2015) - 2013
- [i2]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
X THEN X: Manipulation of Same-System Runoff Elections. CoRR abs/1301.6118 (2013) - [i1]Zack Fitzsimmons, Edith Hemaspaandra, Lane A. Hemaspaandra:
Control in the Presence of Manipulators: Cooperative and Competitive Cases. CoRR abs/1308.0544 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
