Fitness among competitive agents: A brief note

The upshot of the No Free Lunch theorems is that averaged over all fitness functions, evolutionary computation does no better than blind search (see Dembski 2002, ch 4 as well as Dembski 2005 for an overview). But this raises a question: How does evolutionary computation obtain its power since, clearly, it is capable of doing better than blind search? One approach is to limit the fitness functions (see Igel and Toussaint 2001). Another, illustrated in David Fogel’s work on automated checker and chess playing (see, for instance, Chellapilla and Fogel 1999 and Fogel et al. 2004) and, more recently, given a theoretical underpinning by David Wolpert and William Macready (2005), is to limit optimization problems to search spaces consisting of agents that play competitively against one another. In this brief note, I focus on the latter attempt to get around the force of No Free Lunch.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,879
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

14 ( #180,137 of 1,725,194 )

Recent downloads (6 months)

5 ( #134,514 of 1,725,194 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.