A tournament problem (Q5917494)

Suppose \(n\) teams participate in a round-robin tournament. Each team consists of \(p\) players and when two teams meet each member of each team plays against each member of the other team once; there are no draws. The author determines, for any given \(k\), the maximum number \(w\) of wins that can be achieved by each of \(k\) players. And, among other things, when \(p= 3\) he determines, for any given \(w\), the maximum number \(k\) of players who can win at least \(w\) games each.