Motivated by classical nontransitivity paradoxes, we call an
-tuple
cyclic if there exist independent random variables
with
for
such
that
for
and
. We call
the tuple
nontransitive if it is cyclic and in addition satisfies
for
all
.
Let
(resp. )
denote the probability that a randomly chosen
-tuple
is cyclic (resp. nontransitive).
We determine
and
exactly, while for
we give upper and
lower bounds for
that show that
converges to
as
.
We also determine the distribution of the smallest, middle, and largest elements in a
cyclic triple.
PDF Access Denied
We have not been able to recognize your IP address
18.119.131.72
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.