Skip to main content
Article thumbnail
Location of Repository

Convergence of preference functions

By Achim Jung and Jonathan E. Rowe

Abstract

A 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 coevolutionary 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 convex preference function (or “solution concept”). We simplify and extend the scope of this previous work, examining the relationship between convexity and convergence properties

Topics: preference functions, convergence, continuity, convex function, co-evolutionary
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.296
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.bham.ac.uk/~axj/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.