Hot of the Press: Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
This work significantly enhance the understanding of the dynamics of the GSEMO, in particular, for the classic CountingOnesCountingZeros benchmark, and proves a lower bound of order Ω(n2 log n), for the first time matching the seminal upper bounds known for over twenty years.