Alistair Benford
Embedded Files
I am currently a research associate at the University of Edinburgh where I am working with Heng Guo. My research interests include randomised algorithms, competitive coevolution, mathematical foundations of machine learning, game theory, and graph theory. Until recently I was a postdoc of Per Kristian Lehre at the University of Birmingham, and prior to this I undertook a PhD as part of Birmingham's Combinatorics, Probability and Algorithms group where I was a student of Richard Montgomery. Between 2015 and 2019 I completed an MMath at the University of Cambridge.
Email: abenford [at] ed [dot] ac [dot] uk
Research
Theoretical guarantees for the retention of strict Nash equilibria by coevolutionary algorithmsAlistair Benford, Per Kristian LehreAdvances in Neural Information Processing Systems (NeurIPS), 2025
Why playing against diverse and challenging opponents speeds up coevolution: A theoretical analysis on combinatorial gamesAlistair Benford, Per Kristian LehreAdvances in Neural Information Processing Systems (NeurIPS), 2025
A general upper bound for the runtime of a coevolutionary algorithm on impartial combinatorial gamesAlistair Benford, Per Kristian LehreProceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2025
Runtime analysis of coevolutionary algorithms on a class of symmetric zero-sum gamesAlistair Benford, Per Kristian LehreProceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2024
Bicriteria optimisation of average and worst-case performance using coevolutionary algorithmsAlistair Benford, Markus Olhofer, Tobias Rodemann, Per Kristian LehreProceedings of the IEEE Congress on Evolutionary Computation (CEC), 2024
Unavoidable structures in infinite tournaments Alistair Benford, Louis DeBiasio, Paul LarsonProceedings of the American Mathematical Society, 2024
Trees with many leaves in tournamentsAlistair Benford, Richard MontgomeryJournal of Combinatorial Theory, Series B, 2025
Trees with few leaves in tournamentsAlistair Benford, Richard MontgomeryJournal of Combinatorial Theory, Series B, 2022
On the appearance of oriented trees in tournamentsPhD thesis, University of Birmingham, 2023
Theoretical guarantees for the retention of strict Nash equilibria by coevolutionary algorithmsAlistair Benford, Per Kristian LehreAdvances in Neural Information Processing Systems (NeurIPS), 2025
Why playing against diverse and challenging opponents speeds up coevolution: A theoretical analysis on combinatorial gamesAlistair Benford, Per Kristian LehreAdvances in Neural Information Processing Systems (NeurIPS), 2025
A general upper bound for the runtime of a coevolutionary algorithm on impartial combinatorial gamesAlistair Benford, Per Kristian LehreProceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2025
Runtime analysis of coevolutionary algorithms on a class of symmetric zero-sum gamesAlistair Benford, Per Kristian LehreProceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2024
Bicriteria optimisation of average and worst-case performance using coevolutionary algorithmsAlistair Benford, Markus Olhofer, Tobias Rodemann, Per Kristian LehreProceedings of the IEEE Congress on Evolutionary Computation (CEC), 2024
Unavoidable structures in infinite tournaments Alistair Benford, Louis DeBiasio, Paul LarsonProceedings of the American Mathematical Society, 2024
Trees with many leaves in tournamentsAlistair Benford, Richard MontgomeryJournal of Combinatorial Theory, Series B, 2025
Trees with few leaves in tournamentsAlistair Benford, Richard MontgomeryJournal of Combinatorial Theory, Series B, 2022
On the appearance of oriented trees in tournamentsPhD thesis, University of Birmingham, 2023
Page updated
Google Sites
Report abuse