Multiwinner Voting in Genetic Algorithms for Solving Ill-Posed Global Optimization Problems

  • Piotr Faliszewski
  • Jakub Sawicki
  • Robert Schaefer
  • Maciej Smołka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9597)


Genetic algorithms are a group of powerful tools for solving ill-posed global optimization problems in continuous domains. In case in which the insensitivity of the fitness function is the main obstacle, the most desired feature of a genetic algorithm is its ability to explore plateaus of the fitness function, surrounding its minimizers. In this paper we suggest a way of maintaining diversity of the population in the plateau regions, based on a new approach for the selection based on the theory of multiwinner elections among autonomous agents. The paper delivers a detailed description of the new selection algorithm, computational experiments that guide the choice of the proper multiwinner rule to use, and a preliminary experiment showing the proposed algorithm’s effectiveness in exploring a fitness function’s plateau.


Ill-posed global optimization problems New tournament-like selection Fitness insensitivity 


  1. 1.
    Zeidler, E.: Nonlinear Functional Analysis and its Application: II/A: Linear Monotone Operators. Springer, New York (2000)Google Scholar
  2. 2.
    Črepinšek, M., Liu, S.H., Mernik, M.: Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput. Surv. 45(3), 3–35 (2013)zbMATHGoogle Scholar
  3. 3.
    Gupta, D., Ghafir, S.: An overview of methods maintaining diversity in genetic algorithms. Int. J. Emerg. Technol. Adv. Eng. 2(5), 56–60 (2012)Google Scholar
  4. 4.
    Schaefer, R.: Foundation of Genetic Global Optimization (with Chap. 6 by Telega H.). Studies in Computational Intelligence Series, vol. 74. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Goldberg, D., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. genetic algorithms and their applications. In: Proceedings of 2nd International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, pp. 41–49 (1987)Google Scholar
  6. 6.
    Bosman, P., Thierens, D.: The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans. Evol. Comput. 7(2), 174–188 (2003)CrossRefGoogle Scholar
  7. 7.
    Hutter, M.: Fitness uniform selection to preserve genetic diversity. In: Proceedings of the 2002 Congres of Evolutionary Computation, pp. 783–788 (2002)Google Scholar
  8. 8.
    Matsui, K.: New selection method to improve the population diversity in genetic algorithms. In: Proceedings of IEEE International Conference on Systems, Man and Cybernetics, pp. 625–630 (1999)Google Scholar
  9. 9.
    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
  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.
    Monroe, B.: Fully proportional representation. Am. Polit. Sci. Rev. 89(4), 925–940 (1995)CrossRefGoogle Scholar
  12. 12.
    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
  13. 13.
    Skowron, P., Faliszewski, P., Slinko, A.: Fully proportional representation as resource allocation: approximability results. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp. 353–359. AAAI Press (2013)Google Scholar
  14. 14.
    Procaccia, A., Rosenschein, J., Zohar, A.: On the complexity of achieving proportional representation. Soc. Choice Welfare 30(3), 353–362 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. J. Artif. Intell. Res. 47, 475–519 (2013)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Skowron, P., Yu, L., Faliszewski, P., Elkind, E.: The complexity of fully proportional representation for single-crossing electorates. In: Vöcking, B. (ed.) SAGT 2013. LNCS, vol. 8146, pp. 1–12. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  17. 17.
    Elkind, E., Faliszewski, P., Skowron, P.: A characterization of the single-peaked single-crossing domain. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 654–660 (2014)Google Scholar
  18. 18.
    Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14(1), 265–294 (1978)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Piotr Faliszewski
    • 1
  • Jakub Sawicki
    • 1
  • Robert Schaefer
    • 1
  • Maciej Smołka
    • 1
  1. 1.AGH University of Science and TechnologyKrakówPoland

Personalised recommendations