1. Min–max and min–max regret versions of combinatorial optimization problems: A survey
2. Abdullah Al-Dujaili , Erik Hemberg , Una-May O'Reilly , and Tom Schmiedlechner . 2018. Towards Distributed Coevolutionary GANs. CoRR abs/1807.08194 ( 2018 ). arXiv:1807.08194 http://arxiv.org/abs/1807.08194 Abdullah Al-Dujaili, Erik Hemberg, Una-May O'Reilly, and Tom Schmiedlechner. 2018. Towards Distributed Coevolutionary GANs. CoRR abs/1807.08194 (2018). arXiv:1807.08194 http://arxiv.org/abs/1807.08194
3. Robert Axelrod et al. 1987. The evolution of strategies in the iterated prisoner's dilemma. The dynamics of norms 1 (1987) 1--16. Robert Axelrod et al. 1987. The evolution of strategies in the iterated prisoner's dilemma. The dynamics of norms 1 (1987) 1--16.
4. Jürgen Branke and Johanna Rosenbusch . 2008. New approaches to coevolutionary worst-case optimization . In Parallel Problem Solving from Nature - PPSN X (Lecture Notes in Computer Science , Vol. 5199). Springer, Dortmund, Germany, 144-- 153 . Jürgen Branke and Johanna Rosenbusch. 2008. New approaches to coevolutionary worst-case optimization. In Parallel Problem Solving from Nature - PPSN X (Lecture Notes in Computer Science, Vol. 5199). Springer, Dortmund, Germany, 144--153.
5. Multiplicative Up-Drift