Click here to flash read.
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 one as n tends to
infinity. Our object here is to give a proof of this result along with some
historical remarks and comments.
Click here to read this post out
ID: 648353; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: Dec. 31, 2023, 7:33 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 16
CC:
No creative common's license
No creative common's license
Comments: