Author:
Cechlárová Katarína,Lesca Julien,Trellová Diana,Hančová Martina,Hanč Jozef
Abstract
AbstractWe consider elections where the set of candidates is split into parties and each party can nominate just one candidate. We study the computational complexity of two problems. The Possible President problem asks whether a given party candidate can become the unique winner of the election for some nominations from other parties. The Necessary President is the problem to decide whether a given candidate will be the unique winner of the election for any possible nominations from other parties. We consider several different voting rules and show that for all of them the Possible President problem is NP-complete, even if the size of each party is at most two; for some voting rules we prove that the Necessary President is coNP-complete. Further, we formulate integer programs to solve the Possible President and Necessary President problems and test them on real and artificial data.
Funder
Agentúra na Podporu Výskumu a Vývoja
Vedecká Grantová Agentúra MŠVVaŠ SR a SAV
University of Pavol Jozef Šafárik, Slovakia
Pavol Jozef Šafárik University in Košice
Publisher
Springer Science and Business Media LLC
Reference37 articles.
1. Bartholdi, J., Tovey, C., & Trick, M. (1992). How hard is it to control an election. Mathematical and Computer Modelling, 16(8–9), 27–40.
2. Baumeister, D., & Rothe, J. (2012). Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. Information Processing Letters, 112(5), 186–190.
3. Baumeister, D., & Rothe, J. (2016). Preference aggregation by voting. In J. Rothe (Ed.), Economics and Computation (pp. 197–326). Springer.
4. Baumeister, D., Roos, M., Rothe, J., Schend, L., & Xia, L. (2012). The possible winner problem with uncertain weights. In Proceedings of ECAI-12, pp. 133–138.
5. Berman, P., Karpinski, M., & Scott, A. (2003). Approximation hardness of short symmetric instances of max-3sat. Electronic Colloquium on Computational Complexity, Report No. 49.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献