P
Piotr Faliszewski
Researcher at AGH University of Science and Technology
Publications - 215
Citations - 7486
Piotr Faliszewski is an academic researcher from AGH University of Science and Technology. The author has contributed to research in topics: Voting & Condorcet method. The author has an hindex of 46, co-authored 198 publications receiving 6737 citations. Previous affiliations of Piotr Faliszewski include Humboldt University of Berlin & University of Rochester.
Papers
More filters
Journal ArticleDOI
Llull and Copeland voting computationally resist bribery and constructive control
TL;DR: Among systems with a polynomial-time winner problem, Copeland voting is the first natural election system proven to have full resistance to constructive control and vulnerability results for microbribery are proven via a novel technique involving min-cost network flow.
Journal ArticleDOI
AI’s War on Manipulation: Are We Winning?
TL;DR: An overview of more than two decades of work that studies computational complexity as a barrier against manipulation in elections is provided.
Journal ArticleDOI
How hard is bribery in elections
TL;DR: This work obtains both polynomial-time bribery algorithms and proofs of the intractability of bribery, and results show that the complexity of bribery is extremely sensitive to the setting.
Journal ArticleDOI
Using complexity to protect elections
TL;DR: Computational complexity may truly be the shield against election manipulation.
Posted Content
How Hard Is Bribery in Elections
TL;DR: The complexity of influencing elections through bribery was studied in this paper, where the complexity of determining whether by a certain amount of bribing voters a specified candidate can be made the election's winner was studied.