Intersections of random hypergraphs and tournaments

Given two random hypergraphs, or two random tournaments of order nn, how much (or little) can we make them overlap by placing them on the same vertex set? We give asymptotic answers to this question.