From the 1 of 4 linked papers with an AI index.
4 papers
Linear time approximation of the TV distance between product distributions
Konrad Anand, Alistair Benford, Heng Guo
The paper proposes a linear‑time algorithm that approximates the total variation distance between two product distributions.
A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games
Alistair Benford, Per Kristian Lehre
Due to their complex dynamics, combinatorial games are a key test case and application for algorithms that train game playing agents. Among those algorithms that train using self-p…
Trees with many leaves in tournaments
Alistair Benford, Richard Montgomery
Sumner's universal tournament conjecture states that every -vertex tournament should contain a copy of every -vertex oriented tree. If we know the number of leaves of an…
Unavoidable structures in infinite tournaments
Alistair Benford, Louis DeBiasio, Paul Larson
We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs , either (i) there is a countably-in…