2000 character limit reached
On Round-Robin Tournaments with a Unique Maximum Score (2208.14932v5)
Published 31 Aug 2022 in math.CO and math.PR
Abstract: Richard Arnold Epstein (1927-2016) published the first edition of "The Theory of Gambling and Statistical Logic" in 1967. He introduced some material on round-robin tournaments (complete oriented graphs) with n labeled vertices in Chapter 9; in particular, he stated, without proof, that the probability that there is a unique vertex with the maximum score tends to 1 as n tends to infinity. Our object here is to give a proof of this result along with some historical remarks and comments.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.