Shishen Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shishen Lin has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Per Kristian Lehre
University of Birmingham, Birmingham, United Kingdom
5 shared publications - Mario Alejandro Hevia Fajardo
University of Birmingham, Birmingham, United Kingdom
2 shared publications - Christine Zarges
Aberystwyth University
1 shared publication - Frank Neumann
Adelaide University
1 shared publication - Janina Schreiber
Helmholtz Zentrum Dresden Rossendorf, Dresden, Germany
1 shared publication - Joshua Knowles
SLB Cambridge Research, Cambridge, UK
1 shared publication
Latest Publications
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1340-1348
A Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1340-1348
Open AccessA Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 37-38
Hot off the Press: No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 37-38
Open AccessHot off the Press: No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation
- 7 September 2024
- Published by Springer Nature
- p. 117-132
Overcoming Binary Adversarial Optimisation with Competitive Coevolution
- 7 September 2024
- Published by Springer Nature
- p. 117-132
Overcoming Binary Adversarial Optimisation with Competitive Coevolution
- Open Access
- 30 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 73-83
Runtime Analysis of a Co-Evolutionary Algorithm
Co-evolutionary algorithms have found several applications in game-theoretic applications and optimisation problems with an adversary, particularly where the strategy space is discrete and exponentially large, and where classical game-theoretic methods fail. However, the application of co-evolutionary algorithms is difficult because they often display pathological behaviour, such as cyclic behaviour and evolutionary forgetting. These challenges have prevented the broad application of co-evolutionary algorithms. We derive, via rigorous mathematical methods, bounds on the expected time of a simple co-evolutionary algorithm until it discovers a Maximin-solution on the pseudo-Boolean Bilinear problem. Despite the intransitive nature of the problem leading to a cyclic behaviour of the algorithm, we prove that the algorithm obtains the Maximin-solution in expected O(n1.5) time. However, we also show that the algorithm quickly forgets the Maximin-solution and moves away from it. These results in a large total regret of Θ(Tn1.5) after T iterations. Finally, we show that using a simple archive solves this problem reducing the total regret significantly. Along the way, we present new mathematical tools to compute the expected time for co-evolutionary algorithms to obtain a Maximin-solution. We are confident that these tools can help further advance runtime analysis in both co-evolutionary and evolutionary algorithms.
- 30 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 73-83
Open AccessRuntime Analysis of a Co-Evolutionary Algorithm
Co-evolutionary algorithms have found several applications in game-theoretic applications and optimisation problems with an adversary, particularly where the strategy space is discrete and exponentially large, and where classical game-theoretic methods fail. However, the application of co-evolutionary algorithms is difficult because they often display pathological behaviour, such as cyclic behaviour and evolutionary forgetting. These challenges have prevented the broad application of co-evolutionary algorithms. We derive, via rigorous mathematical methods, bounds on the expected time of a simple co-evolutionary algorithm until it discovers a Maximin-solution on the pseudo-Boolean Bilinear problem. Despite the intransitive nature of the problem leading to a cyclic behaviour of the algorithm, we prove that the algorithm obtains the Maximin-solution in expected O(n1.5) time. However, we also show that the algorithm quickly forgets the Maximin-solution and moves away from it. These results in a large total regret of Θ(Tn1.5) after T iterations. Finally, we show that using a simple archive solves this problem reducing the total regret significantly. Along the way, we present new mathematical tools to compute the expected time for co-evolutionary algorithms to obtain a Maximin-solution. We are confident that these tools can help further advance runtime analysis in both co-evolutionary and evolutionary algorithms.
- Open Access
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 819-822
Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 819-822
Open AccessRuntime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation