There is always a player such that every other player was either beaten by him or beaten by a player beaten by him

Every participant of a tournament plays with every other participant exactly once. No game is a draw. After the tournament, every player makes a list with the names of all the players, who either

(i) were beaten by him or (ii) were beaten by a player beaten by him.

Prove that there is a player whose list contains the names of all other players. (Hint: use the extremal principle )

Putnam Competition Math Competitions Game Theory
Savionf Savionf
557
Report

Answer

Answers can only be viewed under the following conditions:
  1. The questioner was satisfied with and accepted the answer, or
  2. The answer was evaluated as being 100% correct by the judge.
View the answer

1 Attachment

Jbarth Jbarth
160
The answer is accepted.
Join Matchmaticians Affiliate Marketing Program to earn up to a 50% commission on every question that your affiliated users ask or answer.