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. Copyright 1992, the President and Fellows of Harvard College and the Massachusetts Institute of Technology.
Volume (Year): 107 (1992)
Issue (Month): 2 (May)
|Contact details of provider:|| Web page: http://mitpress.mit.edu/journals/ |
|Order Information:||Web: http://mitpress.mit.edu/journal-home.tcl?issn=00335533|
When requesting a correction, please mention this item's handle: RePEc:tpr:qjecon:v:107:y:1992:i:2:p:363-405. 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: (Anna Pollock-Nelson)
If references are entirely missing, you can add them using this form.