""Delayed Gratification is used to evaluate the ability of each algorithm undertake actions that temporarily increase Monotonicity Error in order to achieve gains later on. Delayed Gratification is defined as the improvement in Sortedness made by a temporarily error-increasing action.""
Is it slightly analogous in some ways to the avoidance of getting stuck in local maxima perhaps?