Title :
Optimal Nesting of Species for Exact Cover of Resources: Two Against One
Author_Institution :
Dept. of Math. & Comput. Sci., Northern Michigan Univ., Marquette, MI
Abstract :
Experiments for resource-defined fitness sharing (RFS) show a remarkable ability to find tilings in shape nesting problems (Horn, 2002, 2005). These tilings are essentially exact covers for a set of resources, and represent a maximally sized set of cooperating (non-competing) species. This paper initiates a formal analysis of this empirical phenomenon by examining a minimal case: two species a and b "cooperate" to exactly cover the resources, while a third species c "competes" with a and b by overlapping both in terms of covered resources. The analysis reveals that in cases in which a and b maximally compete with c for resources, species c will become extinct, while the optimal set of species, a and b, will survive. This result is clearly proven using algebra on the niching equilibrium equations for RFS, a purely static analysis
Keywords :
algebra; computational geometry; game theory; resource allocation; algebra; formal analysis; niching equilibrium equations; optimal species nesting; resource-defined fitness sharing; shape nesting problems; Algebra; Computational intelligence; Computer science; Drives; Equations; Mathematics; Resource management; Shape; Tiles; USA Councils;
Conference_Titel :
Foundations of Computational Intelligence, 2007. FOCI 2007. IEEE Symposium on
Conference_Location :
Honolulu, HI
Print_ISBN :
1-4244-0703-6
DOI :
10.1109/FOCI.2007.372187