Binary linear programming solutions and non-approximability for control problems in voting systems
Frank Gurski,Magnus Roos +1 more
TL;DR: This paper shows how to characterize the optimization versions of these four control problems as special digraph problems and binary linear programming formulations of linear size and proves the hardness of approximations with absolute performance guarantee for optimal constructive control by deleting candidates in Copeland and by adding candidates in Llull voting schemes.
read more
About: This article is published in Discrete Applied Mathematics. The article was published on 01 Jan 2014. and is currently open access. The article focuses on the topics: Constructive.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Channel Assignment Algorithms in Cognitive Radio Networks: Taxonomy, Open Issues, and Challenges
TL;DR: This paper presents a comprehensive survey on the state-of-the-art channel assignment algorithms in cognitive radio networks, and classify the algorithms by presenting a thematic taxonomy of the current channel assignments algorithms in Cognitive radio networks.
184
Having a Hard Time? Explore Parameterized Complexity!
Britta Dorn,Ildikó Schlotter +1 more
- 01 Jan 2017
TL;DR: Taking a casual look at the landscape of computational problems in social choice, the authors find an abundance of hard problems, let it be judgment aggregation, auctions, fair division of goods, or matching under preferences.
12
Solving Hard Control Problems in Voting Systems via Integer Programming
TL;DR: This article presents integer linear programming (ILP) formulations for a wide range of NP-hard control problems and shows that these approaches can manipulate elections with a large number of voters and candidates efficiently.
•Posted Content
A Geometric Framework for the Inconsistency in Pairwise Comparisons
TL;DR: In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group $G$, non necessarily abelian and basic criteria for finding a nearest consistent pairwise comparisons matrix are proposed.
6
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Parameterized complexity theory
Jörg Flum,Martin Grohe +1 more
- 01 Jan 2010
TL;DR: Fixed-Parameter Tractability.
2.7K