AbstractAn 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. Copyright 1992, the President and Fellows of Harvard College and the Massachusetts Institute of Technology.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
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.
Bibliographic InfoPaper provided by Harvard - Institute of Economic Research in its series Harvard Institute of Economic Research Working Papers with number 1553.
Length: 50 pages
Date of creation: 1991
Date of revision:
Other versions of this item:
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.