Non-monotone insurence contracts and their empirical consequences

The goal of t.his paper is to show the possibility of a non-monot.one relation between coverage and risk which has been considered in the literature of insurance models since the work of Rothschild and Stiglitz (1976). We present an insurance model where the insured agents have heterogeneity in risk aversion and in lenience (a prevention cost parameter). Risk aversion is described by a continuou.'l parameter which is correlated with lenience and, for the sake of simplicity, we assume perfect correlation. In the case of positive correlation, the more risk averse agent has higher cost of prevention leading to a higher demand for coverage. Equivalently, the single crossing property (SCP) is valid and implies a positive correlation between coverage and risk in equilibrium. On the other hand, if the correlation between risk aversion and lenience is negative, not only may the sep be broken, but also the monotonicity of contracts, i.e., the prediction that high (Iow) risk averse types choose full (partial) insurance. In both cases riskiness is monotonic in risk aversion, but in the last case t,here are some coverage leveIs associated with two different risks (low and high), which implies that the ex-ante (with respect to the risk aversion distribution) correlation bet,ween coverage and riskiness may have every sign (even though the ex-post correlation is always positive). Moreover, using another instrument (a proxy for riskiness), we give a testable implication to disentangle single crossing and non single crossing under an ex-post zero correlation result: the monotonicity of coverage as a function of riskiness. Since by controlling for risk aversion (no asymmetric informat, ion), coverage is a monotone function of riskiness, this also gives a test for asymmetric information. Finally, we relate this theoretical results to empirica! tests in the recent literature, specially the Dionne, Gouriéroux and Vanasse (2001) work. In particular, they found an empirical evidence that seems to be compatible with asymmetric information and non single crossing in our framework. More generally, we build a hidden information model showing how omitted variabIes (asymmetric information) can bias the sign of the correlation of equilibrium variabIes conditioning on ali observabIe variabIes. We show that this may be t,he case when the omitted variabIes have a non-monotonic reIation with t,he observable ones. Moreover, because this non-monotonic reIat,ion is deepIy reIated with the failure of the SCP in one-dimensional screening problems, the existing lit.erature on asymmetric information does not capture t,his feature. Hence, our main result is to point Out the importance of t,he SCP in testing predictions of the hidden information models.

Convexity of the extreme zeros of Gegenbauer and Laguerre polynomials

Let C-n(lambda)(x), n = 0, 1,..., lambda > -1/2, be the ultraspherical (Gegenbauer) polynomials, orthogonal. in (-1, 1) with respect to the weight function (1 - x(2))(lambda-1/2). Denote by X-nk(lambda), k = 1,....,n, the zeros of C-n(lambda)(x) enumerated in decreasing order. In this short note, we prove that, for any n is an element of N, the product (lambda + 1)(3/2)x(n1)(lambda) is a convex function of lambda if lambda greater than or equal to 0. The result is applied to obtain some inequalities for the largest zeros of C-n(lambda)(x). If X-nk(alpha), k = 1,...,n, are the zeros of Laguerre polynomial L-n(alpha)(x), also enumerated in decreasing order, we prove that x(n1)(lambda)/(alpha + 1) is a convex function of alpha for alpha > - 1. (C) 2002 Published by Elsevier B.V. B.V.

On the behaviour of zeros of Jacobi polynomials

Denote by x(n,k)(alpha, beta) and x(n,k) (lambda) = x(n,k) (lambda - 1/2, lambda - 1/2) the zeros, in decreasing order, of the Jacobi polynomial P-n((alpha, beta))(x) and of the ultraspherical (Gegenbauer) polynomial C-n(lambda)(x), respectively. The monotonicity of x(n,k)(alpha, beta) as functions of a and beta, alpha, beta > - 1, is investigated. Necessary conditions such that the zeros of P-n((a, b)) (x) are smaller (greater) than the zeros of P-n((alpha, beta))(x) are provided. A. Markov proved that x(n,k) (a, b) < x(n,k)(α, β) (x(n,k)(a, b) > x(n,k)(alpha, beta)) for every n is an element of N and each k, 1 less than or equal to k less than or equal to n if a > alpha and b < β (a < alpha and b > beta). We prove the converse statement of Markov's theorem. The question of how large the function could be such that the products f(n)(lambda) x(n,k)(lambda), k = 1,..., [n/2] are increasing functions of lambda, for lambda > - 1/2, is also discussed. Elbert and Siafarikas proved that f(n)(lambda) = (lambda + (2n(2) + 1)/ (4n + 2))(1/2) obeys this property. We establish the sharpness of their result. (C) 2002 Elsevier B.V. (USA).

L-orthogonal polynomials associated with related measures

A positive measure psi defined on [a, b] such that its moments mu(n) = integral(b)(a)t(n) d psi(t) exist for n = 0, +/-1, +/-2. can be called a strong positive measure on [a, b] When 0 <= a < b <= infinity the sequence of polynomials {Q(n)} defined by integral(b)(a) t(-n+s) Q(n)(t) d psi(t) = 0, s = 0, ., n - 1, exist and they are referred here as L-orthogonal polynomials We look at the connection between two sequences of L-orthogonal polynomials {Q(n)((1))} and {Q(n)((0))} associated with two closely related strong positive measures and th defined on [a, b]. To be precise, the measures are related to each other by (t - kappa) d psi(1)(t) = gamma d psi(0)(t). where (t - kappa)/gamma is positive when t is an element of (n, 6). As applications of our study. numerical generation of new L-orthogonal polynomials and monotonicity properties of the zeros of a certain class of L-orthogonal polynomials are looked at. (C) 2010 IMACS Published by Elsevier B V All rights reserved

A mass-transportation approach to a one dimensional fluid mechanics model with nonlocal velocity

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Reformulation of variational inequalities on a simplex and compactification of complementarity problems

Many variational inequality problems (VIPs) can be reduced, by a compactification procedure, to a VIP on the canonical simplex. Reformulations of this problem are studied, including smooth reformulations with simple constraints and unconstrained reformulations based on the penalized Fischer-Burmeister function. It is proved that bounded level set results hold for these reformulations under quite general assumptions on the operator. Therefore, it can be guaranteed that minimization algorithms generate bounded sequences and, under monotonicity conditions, these algorithms necessarily nd solutions of the original problem. Some numerical experiments are presented.

Chain sequences and symmetric generalized orthogonal polynomials

in this paper, we derive an explicit expression for the parameter sequences of a chain sequence in terms of the corresponding orthogonal polynomials and their associated polynomials. We use this to study the orthogonal polynomials K-n((lambda.,M,k)) associated with the probability measure dphi(lambda,M,k;x), which is the Gegenbauer measure of parameter lambda + 1 with two additional mass points at +/-k. When k = 1 we obtain information on the polynomials K-n((lambda.,M)) which are the symmetric Koornwinder polynomials. Monotonicity properties of the zeros of K-n((lambda,M,k)) in relation to M and k are also given. (C) 2002 Elsevier B.V. B.V. All rights reserved.

Zeros of orthogonal polynomials generated by canonical perturbations of measures

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

On the regularization of mixed complementarity problems

A variational inequality problem (VIP) satisfying a constraint qualification can be reduced to a mixed complementarity problem (MCP). Monotonicity of the VIP implies that the MCP is also monotone. Introducing regularizing perturbations, a sequence of strictly monotone mixed complementarity problems is generated. It is shown that, if the original problem is solvable, the sequence of computable inexact solutions of the strictly monotone MCP's is bounded and every accumulation point is a solution. Under an additional condition on the precision used for solving each subproblem, the sequence converges to the minimum norm solution of the MCP. Copyright © 2000 by Marcel Dekker, Inc.

Zeros of a family of hypergeometric para-orthogonal polynomials on the unit circle

Para-orthogonal polynomials derived from orthogonal polynomials on the unit circle are known to have all their zeros on the unit circle. In this note we study the zeros of a family of hypergeometric para-orthogonal polynomials. As tools to study these polynomials, we obtain new results which can be considered as extensions of certain classical results associated with three term recurrence relations and differential equations satisfied by orthogonal polynomials on the real line. One of these results which might be considered as an extension of the classical Sturm comparison theorem, enables us to obtain monotonicity with respect to the parameters for the zeros of these para-orthogonal polynomials. Finally, a monotonicity of the zeros of Meixner-Pollaczek polynomials is proved. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Interlacing of zeros of orthogonal polynomials under modification of the measure

We investigate the mutual location of the zeros of two families of orthogonal polynomials. One of the families is orthogonal with respect to the measure dμ (x), supported on the interval (a, b) and the other with respect to the measure |x -c|τ|x -d|γdμ (x), where c and d are outside (a, b) We prove that the zeros of these polynomials, if they are of equal or consecutive degrees, interlace when either 0 < τ, γ ≤ 1 or γ = 0 and 0 < τ ≤ 2. This result is inspired by an open question of Richard Askey and it generalizes recent results on some families of orthogonal polynomials. Moreover, we obtain further statements on interlacing of zeros of specific orthogonal polynomials, such as the Askey-Wilson ones. © 2013 Elsevier Inc.

Teorema de Sturm e zeros de polinômios ortogonais

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Monotonicidade de zeros de polinômios ortogonais clássicos

Pós-graduação em Matematica Aplicada e Computacional - FCT

Polinômios ortogonais de Laurent na reta real e no círculo unitário

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Zeros de combinações lineares de polinômios

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)