The Complexity of Voter Control and Shift Bribery Under Parliament Choosing Rules

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9760)

Abstract

We study the complexity of voter control and shift bribery problems under two parliament choosing rules, one based on the Plurality rule and one based on the Borda rule (considering both the case where there is a threshold a party needs to pass to enter the parliament, and the case where there is no such threshold). A parliament choosing rule is a function that given a preference profile of the voters (where each voter ranks political parties) outputs the fraction of seats each of the parties should receive in the parliament. We study the complexity of three problems, shift bribery, control by adding voters, and control by deleting voters, where some agent modifies the election in order to increase the fraction of the seats in parliament assigned to a given party. We show that in most cases these problems can be solved in polynomial time for our parliament choosing rules, but we also show several \({{\mathrm {NP}}}\)-hardness results (for the Borda-based rule, for the case where there is a threshold for entering the parliament).

References

  1. 1.
    Aziz, H., Brill, M., Conitzer, V., Elkind, E., Freeman, R., Walsh, T.: Justified representation in approval-based committee voting. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp. 784–790 (2015)Google Scholar
  2. 2.
    Bartholdi III, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welfare 6(3), 227–241 (1989)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bartholdi III, J., Tovey, C., Trick, M.: How hard is it to control an election? Math. Comput. Model. 16(8/9), 27–40 (1992)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Baumeister, D., Faliszewski, P., Lang, J., Rothe, J.: Campaigns for lazy voters: truncated ballots. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, pp. 577–584. International Foundation for Autonomous Agents and Multiagent Systems, June 2012Google Scholar
  5. 5.
    Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. J. Artif. Intell. Res. 47, 475–519 (2013)MathSciNetMATHGoogle Scholar
  6. 6.
    Brandt, F., Conitzer, V., Endriss, U.: Computational social choice. In: Weiß, G. (ed.) Multiagent Systems. MIT Press (2012). ForthcomingGoogle Scholar
  7. 7.
    Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., Niedermeier, R.: Prices matter for the parameterized complexity of shift bribery. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 1398–1404. AAAI Press (2014)Google Scholar
  8. 8.
    Bredereck, R., Faliszewski, P., Niedermeier, R., Talmon, N.: Large-scale election campaigns: combinatorial shift bribery. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 67–75 (2015)Google Scholar
  9. 9.
    Bredereck, R., Faliszewski, P., Niedermeier, R., Talmon, N.: Complexity of shift bribery in committee elections. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence, pp. 2452–2458 (2016)Google Scholar
  10. 10.
    Chamberlin, B., Courant, P.: Representative deliberations and representative decisions: proportional representation and the Borda rule. Am. Polit. Sci. Rev. 77(3), 718–733 (1983)CrossRefGoogle Scholar
  11. 11.
    Cox, G.: Making Votes Count: Strategic Coordination in the World’s Electoral Systems. Cambridge University Press, Cambridge (1997)CrossRefGoogle Scholar
  12. 12.
    Dorn, B., Schlotter, I.: Multivariate complexity analysis of swap bribery. Algorithmica 64(1), 126–151 (2012)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Elkind, E., Faliszewski, P.: Approximation algorithms for campaign management. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 473–482. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Elkind, E., Faliszewski, P., Skowron, P., Slinko, A.: Properties of multiwinner voting rules. In: Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems, pp. 53–60, May 2014Google Scholar
  15. 15.
    Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 299–310. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  16. 16.
    Erdélyi, G., Fellows, M., Rothe, J., Schend, L.: Control complexity in Bucklin and fallback voting: an experimental analysis. J. Comput. Syst. Sci. 81(4), 661–670 (2015)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485–532 (2009)MathSciNetMATHGoogle Scholar
  18. 18.
    Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Using complexity to protect elections. Commun. ACM 53(11), 74–82 (2010)CrossRefGoogle Scholar
  19. 19.
    Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Multimode control attacks on elections. J. Artif. Intell. Res. 40, 305–351 (2011)MathSciNetMATHGoogle Scholar
  20. 20.
    Faliszewski, P., Reisch, Y., Rothe, J., Schend, L.: Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Auton. Agents Multiagent Syst. 29(6), 1091–1124 (2015)CrossRefGoogle Scholar
  21. 21.
    Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, chap. 7. Cambridge University Press (2015)Google Scholar
  22. 22.
    Friedgut, E., Kalai, G., Nisan, N.: Elections can be manipulated often. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pp. 243–249. IEEE Computer Society, October 2008Google Scholar
  23. 23.
    Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)MATHGoogle Scholar
  24. 24.
    Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Anyone but him: the complexity of precluding an alternative. Artif. Intell. 171(5–6), 255–285 (2007)MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)CrossRefMATHGoogle Scholar
  26. 26.
    Kilgour, M.: Approval balloting for multi-winner elections. In: Laslier, J.-F., Sanver, M.R. (eds.) Handbook on Approval Voting, chap. 6. Studies in Choice and Welfare, pp. 105–124. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  27. 27.
    Lu, T., Boutilier, C.: Budgeted social choice: from consensus to personalized decision making. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 280–286 (2011)Google Scholar
  28. 28.
    Meir, R., Procaccia, A., Rosenschein, J., Zohar, A.: The complexity of strategic behavior in multi-winner elections. J. Artif. Intell. Res. 33, 149–178 (2008)MathSciNetMATHGoogle Scholar
  29. 29.
    Miąsko, T., Faliszewski, P.: The complexity of priced control in elections. Ann. Math. Artif. Intell. (to appear, 2016)Google Scholar
  30. 30.
    Monroe, B.: Fully proportional representation. Am. Polit. Sci. Rev. 89(4), 925–940 (1995)CrossRefGoogle Scholar
  31. 31.
    Procaccia, A., Rosenschein, J., Zohar, A.: On the complexity of achieving proportional representation. Soc. Choice Welfare 30(3), 353–362 (2008)MathSciNetCrossRefMATHGoogle Scholar
  32. 32.
    Pukelscheim, F.: Proportional Representation. Springer, Switzerland (2014)CrossRefGoogle Scholar
  33. 33.
    Roberts, G.: The ‘second-vote’ campaign strategy of the west german free democratic party. Eur. J. Polit. Res. 16, 317–337 (1988)CrossRefGoogle Scholar
  34. 34.
    Schlotter, I., Faliszewski, P., Elkind, E.: Campaign management under approval-driven voting rules. In: Proceedings of the 25th AAAI Conference on Artificial Intelligence, pp. 726–731. AAAI Press, August 2011Google Scholar
  35. 35.
    Shapley, L., Shubik, M.: A method of evaluating the distribution of power in a committee system. Am. Polit. Sci. Rev. 48, 787–792 (1954)CrossRefGoogle Scholar
  36. 36.
    Shiryaev, D., Yu, L., Elkind, E.: On elections with robust winners. In: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems, pp. 415–422, May 2013Google Scholar
  37. 37.
    Skowron, P., Faliszewski, P., Slinko, A.: Achieving fully proportional representation: approximability result. Artif. Intell. 222, 67–103 (2015)MathSciNetCrossRefGoogle Scholar
  38. 38.
    Slinko, A., White, S.: Proportional representation and strategic voters. J. Theor. Politics 22(3), 301–332 (2010)CrossRefGoogle Scholar
  39. 39.
    Walsh, T.: Where are the hard manipulation problems. J. Artif. Intell. Res. 42(1), 1–29 (2011)MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.AGH UniversityKrakowPoland

Personalised recommendations