Alistair Benford

According to our database, Alistair Benford authored at least 8 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Trees with many leaves in tournaments.

Alistair Benford, Richard Montgomery

J. Comb. Theory B, 2025

Why Playing Against Diverse and Challenging Opponents Speeds Up Coevolution: A Theoretical Analysis on Combinatorial Games.

Alistair Benford, Per Kristian Lehre

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Theoretical Guarantees for the Retention of Strict Nash Equilibria by Coevolutionary Algorithms.

Alistair Benford, Per Kristian Lehre

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games.

Alistair Benford, Per Kristian Lehre

Proceedings of the Genetic and Evolutionary Computation Conference, 2025

2024

Runtime analysis of a coevolutionary algorithm on impartial combinatorial games.

Alistair Benford, Per Kristian Lehre

CoRR, 2024

Runtime Analysis of Coevolutionary Algorithms on a Class of Symmetric Zero-Sum Games.

Alistair Benford, Per Kristian Lehre

Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Bicriteria Optimisation of Average and Worst-Case Performance Using Coevolutionary Algorithms.

Alistair Benford, Markus Olhofer, Tobias Rodemann, Per Kristian Lehre

Proceedings of the IEEE Congress on Evolutionary Computation, 2024

2022

Trees with few leaves in tournaments.

Alistair Benford, Richard Montgomery

J. Comb. Theory B, 2022