1. Bartholdi III, J., & Orlin, J. (1991). Single transferable vote resists strategic voting. Social Choice and Welfare, 8(4), 341–354.
2. Bartholdi III, J., Tovey, C., & Trick, M. (1989). The computational difficulty of manipulating an election. Social Choice and Welfare, 6(3), 227–241.
3. Bartholdi III, J., Tovey, C., & Trick, M. (1992). How hard is it to control an election? Mathematical and Computer Modeling, 16(8–9), 27–40.
4. Baumeister, D., Roos, M., & Rothe, J. (2011). Computational complexity of two variants of the possible winner problem. In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (pp. 853–860). International Foundation for Autonomous Agents and Multiagent Systems.
5. Baumeister, D., Roos, M., Rothe, J., Schend, L., & Xia, L. (2012). The possible winner problem with uncertain weights. In Proceedings of the 20th European Conference on Artificial Intelligence (pp. 133–138). IOS Press.