MathDB

A round robin tournament is held with

2016

participants. Each round, after seeing the results from the previous round, the tournament organizer chooses two players to play a game with each other that will result in a win for one of the players and a loss for the other. The tournament organizer wants each person to have a different total number of wins at the end of

k

rounds. Find the minimum possible value of

k

for which this can always be guaranteed.
Proposed by Nathan Ramesh

Problem Statement