Consumer Expertise or Credit Risk? An empirical analysis of mortgage pricing

Loan mortgage interest rates are usually the result of a bank-customer negotiation process. Credit risk, consumer cross-buying potential, bundling, financial market competition and other features affecting the bargaining power of the parties could affect price. We argue that, since mortgage loan is a complex product, consumer expertise could be a relevant factor for mortgage pricing. Using data on mortgage loan prices for a sample of 1055 households for the year 2005 (Bank of Spain Survey of Household Finances, EFF-2005), and including credit risk, costs, potential capacity of the consumer to generate future business and bank competition variables, the regression results indicate that consumer expertise-related metrics are highly significant as predictors of mortgage loan prices. Other factors such as credit risk and consumer cross-buying potential do not have such a significant impact on mortgage prices. Our empirical results are affected by the credit conditions prior to the financial crisis and could shed some light on this issue.

Asymptotic Hyperstability of a Class of Linear Systems under Impulsive Controls Subject to an Integral Popovian Constraint

This paper is focused on the study of the important property of the asymptotic hyperstability of a class of continuous-time dynamic systems. The presence of a parallel connection of a strictly stable subsystem to an asymptotically hyperstable one in the feed-forward loop is allowed while it has also admitted the generation of a finite or infinite number of impulsive control actions which can be combined with a general form of nonimpulsive controls. The asymptotic hyperstability property is guaranteed under a set of sufficiency-type conditions for the impulsive controls.

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science

Beyond Q-Resolution and Prenex Form: a Proof System for Quantified Constraint Satisfaction

We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether or not the sentence is true on the structure. We present a proof system for certifying the falsity of QCSP instances and develop its basic theory; for instance, we provide an algorithmic interpretation of its behavior. Our proof system places the established Q-resolution proof system in a broader context, and also allows us to derive QCSP tractability results.