This paper presents a two--factor model of the term structure of interest rates. We assume that default free discount bond prices are determined by the time to maturity and two factors, the long--term interest rate and the spread (difference between the long--term rate and the short--term...

We develop a coordination game to model interactions between fundamentals and liquidity during unstable periods in financial markets. We then propose a flexible econometric framework for estimation of the model and analysis of its quantitative implications. The specific empirical application is...

This paper extends multivariate Granger causality to take into account the subspaces along which Granger causality occurs as well as long run Granger causality. The properties of these new notions of Granger causality, along with the requisite restrictions, are derived and extensively studied...

This article is an introduction to Malliavin Calculus for practitioners. We treat one specific application to the calculation of greeks in Finance. We consider also the kernel density method to compute greeks and an extension of the Vega index called the local vega index.

We discuss some practical issues related to the use of the Parameterized Expectations Approach (PEA) for solving non-linear stochastic dynamic models with rational expectations. This approach has been applied in models of macroeconomics, financial economics, economic growth, contract theory,...

In this paper we present an algorithm to assign proctors to exams. This NP-hard problem is related to the generalized assignment problem with multiple objectives. The problem consists of assigning teaching assistants to proctor final exams at a university. We formulate this problem as a...

From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed...

We address the performance optimization problem in a single-station multiclass queueing network with changeover times by means of the achievable region approach. This approach seeks to obtain performance bounds and scheduling policies from the solution of a mathematical program over a relaxation...

We obtain a recursive formulation for a general class of contracting problems involving incentive constraints. Under these constraints, the corresponding maximization (sup) problems fails to have a recursive solution. Our approach consists of studying the Lagrangian. We show that, under standard...