Sharp bounds on quasiconvex moments of generalized order statistics.
An approximate necessary condition for the optimal bandwidth choice is derived. This condition is used to construct an iterative bandwidth selector. The algorithm is based on resampling and step-wise fitting the bandwidth to the density estimator from the previous iteration. Examples show fast convergence of the algorithm to the bandwidth value which is surprisingly close to the optimal one no matter what is the initial knowledge on the unknown density.
Optimal arrangement of a stream of insurance premiums for a multiperiod insurance policy is considered. In order to satisfy solvency requirements we assume that a weak Axiom of Solvency is satisfied. Then two optimization problems are solved: finding a stream of net premiums that approximates optimally 1) future claims, or 2) "anticipating premiums". It is shown that the resulting optimal streams of premiums enable differentiating between policyholders much more quickly than one-period credibility...
Page 1