While standard evolutionary algorithms employ a static, absolute fitness metric, co-evolutionary algorithms assess individuals by their performance relative to populations of opponents that are themselves evolving. Although this arrangement offers the possibility of avoiding long-standing difficulties such as premature convergence, it suffers from its own unique problems, cycling, over-focusing and disengagement. Here, we introduce a novel technique for dealing with the third and least explored of these problems. Inspired by studies of natural host-parasite systems, we show that disengagement can be avoided by selecting for individuals that exhibit reduced levels of “virulence”, rather than maximum ability to defeat coevolutionary adversaries. Experiments in both simple and complex domains are used to explain how this counterintuitive approach may be used to improve the success of coevolutionary algorithms.