@Article{jung13,
author = {A. Jung and J. Rowe},
title = {Convergence of preference functions},
journal = {Theoretical Computer Science},
year = 2013,
volume = 488,
pages = {66--77},
doi = {10.1016/j.tcs.2013.03.023},
abstract = {A \emph{preference function} is a function which selects a subset of objects based on (partial) information. As information increases, different objects may be selected. We examine conditions under which the selection of objects converges to the choice that would be made if full information were available, making use of tools from domain theory. The work is motivated by previous research on \emph{co-evolutionary algorithms} in which an evolving population of agents interact with each other and, it is hoped, produce better and better quality behaviour. The formalisation of how quality can be measured in this context has introduced the concept of a \emph{convex} preference function (or ``solution concept''). We simplify and extend the scope of this previous work, examining the relationship between convexity and convergence properties.}
}