The entropy principle yields, for a given set of moments, a density that involves the smallest amount of prior information. We first show how entropy densities may be constructed in a numerically efficient way as the minimization of a potential. Next, for the case where the first four moments are given, we characterize the skewness-kurtosis domain for which densities are defined. This domain is found to be much larger that for Hermite or Edgeworth expansions. Last, we show how this technique can be used to estimate a GARCH model where skewness and kurtosis are time varying.
|Date of creation:||01 Feb 2000|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.hec.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ebg:heccah:0709. 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: (Sandra Dupouy)
If references are entirely missing, you can add them using this form.