1 citations · 1 across the 5 of their papers we have counts for
5 papers
Hardest Monotone Functions for Evolutionary Algorithms
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
In this paper we revisit the question how hard it can be for the Evolutionary Algorithm to optimize monotone pseudo-Boolean functions. By introducing a more pessimistic sto…
OneMax is not the Easiest Function for Fitness Improvements
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
We study the success rule for controlling the population size of the -EA. It was shown by Hevia Fajardo and Sudholt that this parameter control mechanism can run i…
Self-adjusting Population Sizes for the -EA on Monotone Functions
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
We study the -EA with mutation rate for , where the population size is adaptively controlled with the -success rule. Recently, Hevia Fajardo and Sudho…
Projection Bias in Effort Choices
Marc Kaufmann
Working becomes harder as we grow tired or bored. I model individuals who underestimate these changes in marginal disutility -- as implied by "projection bias" -- when deciding whe…
Arbitraging Narrow Bracketers
Francesco Fallucchi, Marc Kaufmann
Many important economic outcomes result from the combined effects of several choices, so the best option is not determined from each choice in isolation, but depends on how each ch…