The notion of a regular tournament is generalized to r-tournaments. By means of a construction, it is shown that if n∣(nr) and (n,r)=pk, where p is a prime, and k≥0, then there exists a regular r-tournament on n vertices.