An oft-repeated goal in many contexts is the "preservation of diversity." But what is the diversity function to be optimized? This paper shows how a reasonable measure of the "value of diversity" of a collection of objects can be recursively generated from more fundamental information about the dissimilarity-distance between any pair of objects in the set. The diversity function is shown to satisfy a basic dynamic programming equation, which in a well-defined sense generates an optimal classification scheme. A surprisingly rich theory of diversity emerges, having ramifications for several disciplines. Implications and applications are discussed.
(This abstract was borrowed from another version of this item.)
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1991|
|Contact details of provider:|| Postal: 200 Littauer Center, Cambridge, MA 02138|
Web page: http://www.economics.harvard.edu/journals/hier
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:harver:1553. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.