Michael ROCKINGER and Eric JONDEAU
Abstract: 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.
19 pages, February 1, 2000
Full text files
Questions (including download problems) about the papers in this series should be directed to Antoine Haldemann ()
Report other problems with accessing this service to Sune Karlsson ().
This page generated on 2018-02-22 16:52:54.