Sum of squares of in-degrees vs out-degrees in a Tournament Graph This problem was asked in a test, couple of years ago. Looked interesting!
In a chess tournament, each pair of players plays exactly one game. No game is drawn. Suppose the $i^{th}$ player wins $a_{i}$ games and loses $b_{i}$ games. Show that $$\sum a_{i}^{2} = \sum b_{i}^{2}$$
I can't think of a better title. It would be nice in case someone comes up with a nice title.
 A: Consider flipping the result of one game, say between player 1 and 2.
Then $\sum (a_i)^2 - \sum (b_i)^2$ changes by $2(a_1 + b_1) - 2(a_2 + b_2) = 0$ as $a_i + b_i = n-1$, where $n$ is the number of players.
Thus $\sum (a_i)^2 - \sum (b_i)^2$ is the same no matter what the results and thus is same as the extreme case when the winner wins all matches, the runner up all but one etc, for which the sum is 0.
A: Let the number of wins of a random player be A, and let the number of losses of a random player be B. Then A and B have the same mean (half the number of games) and the same variance (since $B = n-A$, where n is the number of players). So $A^2$ and $B^2$ have the same expectation, which is what you want.
(Of course, if you write this out more explicitly it'll resemble Mike Spivey's answer quite closely. But this is what went through my head.)
A: $$\sum (a_i^2 - b_i^2) =  \sum (a_i+b_i)(a_i-b_i) = (n-1) \sum (a_i-b_i) $$
$$= (n-1) \left(\sum a_i - \sum b_i\right) = (n-1)\left(\binom{n}{2} - \binom{n}{2}\right) = 0,$$
where $n$ is the total number of players.  (Each player plays $n-1$ games, so $a_i+b_i = n-1$, and there are a total of $\binom{n}{2}$ games played, so $\sum a_i = \sum b_i = \binom{n}{2}$.)
A: It can be extended so that draw is possible with score of 0 ,
winning score of +1,
losing score of -1,
doing some change in @Mike Spivey answer it is trivial
