The choice of a mate is made complicated by the need to search for partners at the same time others are searching. What decision strategies will outcompete others in a population of searchers? We extend previous approaches using computer simulations to study mate search strategies by allowing direct competition between multiple strategies, evaluating success on multiple criteria. In a mixed social environment of searchers of different types, simple strategies can exploit more demanding strategies in unexpected ways. We find that simple strategies that only aim for speed can beat more selective strategies that aim to maximize the quality or harmony of mated pairs.