Abstract
We review and investigate the current status of intransitivity as a potential obstacle in coevolution. Pareto-Coevolution avoids intransitivity by translating any standard superiority relation into a transitive Pareto-dominance relation. Even for transitive problems though, cycling is possible. Recently however, algorithms that provide monotonic progress for Pareto-Coevolution have become available. The use of such algorithms avoids cycling, whether caused by intransitivity or not. We investigate this in experiments with two intransitive test problems, and find that the IPCA and LAPCA archive methods establish monotonic progress on both test problems, thereby substantially outperforming the same method without an archive.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barricelli, N.A.: Numerical testing of evolution theories. Part I: Theoretical introduction and basic tests. Acta Biotheoretica 16, 69–98 (1962)
Axelrod, R.: The evolution of strategies in the iterated prisoner’s dilemma. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing. Research Notes in Artificial Intelligence, pp. 32–41. Pitman Publishing, London (1987)
Hillis, D.W.: Co-evolving parasites improve simulated evolution in an optimization procedure. Physica D 42, 228–234 (1990)
Paredis, J.: Coevolutionary computation. Artificial Life 2 (1996)
Pagie, L., Hogeweg, P.: Evolutionary consequences of coevolving targets. Evolutionary Computation 5, 401–418 (1998)
Juillé, H.: Methods for Statistical Inference: Extending the Evolutionary Computation Paradigm. PhD thesis, Brandeis University (1999)
Ficici, S.G., Pollack, J.B.: Pareto optimality in coevolutionary learning. In: Kelemen, J. (ed.) Sixth European Conference on Artificial Life, Springer, Berlin (2001)
Cliff, D., Miller, G.F.: Tracking the Red Queen: Measurements of adaptive progress in co-evolutionary simulations. In: Morán, F., Merelo, J.J., Moreno, A., Chacon, P. (eds.) ECAL 1995. LNCS, vol. 929, pp. 200–218. Springer, Heidelberg (1995)
Watson, R.A., Pollack, J.B.: Coevolutionary dynamics in a minimal substrate. In: Spector, L., Goodman, E., Wu, A., Langdon, W., Voigt, H.M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M., Burke, E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2001, pp. 702–709. Morgan Kaufmann, San Francisco (2001)
Nolfi, S., Floreano, D.: Co-evolving predator and prey robots: Do ’arms races’ arise in artificial evolution? Artificial Life 4 (1998)
De Jong, E.D., Pollack, J.B.: Ideal evaluation from coevolution. Evolutionary Computation 12, 159–192 (2004)
Ficici, S.G., Pollack, J.B.: A game-theoretic approach to the simple coevolutionary algorithm. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, Springer, Heidelberg (2000)
Watson, R.A., Pollack, J.B.: Symbiotic combination as an alternative to sexual recombination in genetic algorithms. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, Springer, Heidelberg (2000)
Rosin, C.D.: Coevolutionary Search among Adversaries. PhD thesis, University of California, San Diego, CA (1997)
Ficici, S.G., Pollack, J.B.: A game-theoretic memory mechanism for coevolution. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 286–297. Springer, Heidelberg (2003)
De Jong, E.D.: The Incremental Pareto-Coevolution Archive. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 525–536. Springer, Heidelberg (2004)
De Jong, E.D.: Towards a bounded Pareto-Coevolution archive. In: Proceedings of the Congress on Evolutionary Computation, CEC 2004 (2004)
De Jong, E.D., Pollack, J.B.: Principled Evaluation in Coevolution. Technical Report CS-02-225; May 31 2002, Brandeis University (2002)
Bucci, A., Pollack, J.B.: Focusing versus intransitivity. Geometrical aspects of coevolution. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, Springer, Heidelberg (2003)
Srinivas, N., Deb, K.: Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation 2, 221–248 (1994)
Watson, R.A.: Personal communication (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Jong, E.D. (2004). Intransitivity in Coevolution. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_85
Download citation
DOI: https://doi.org/10.1007/978-3-540-30217-9_85
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23092-2
Online ISBN: 978-3-540-30217-9
eBook Packages: Springer Book Archive