The approximation capabilities of the minflex-Laurents,translog, and generalized Leontief forms

This paper compares the approximation capabilities of the minflex-Laurents translog and minflex generalized Leontief cost functions with their translog and generalized Leontief counterparts in Monte Carlo experiments. The minflex Laurent specifications generally provided closer approximations to underlying technical and economic parameters. Imposition of nonlinear restrictions on some of the parameters of the minflex Laurent models yielded measurable improvement in estimated elasticities of substitutions, returns to scale, and rates of technical change.The refereeing process of this paper was handled through E. Appelbaum.     

Software for Learning and for Doing Statistics

The community of statisticians and statistics educators should take responsibility for the evaluation and improvement of software quality from the perspective of education. The paper will develop a perspective, an ideal system of requirements to critically evaluate existing software and to produce future software more adequate both for learning and doing statistics in introductory courses. Different kinds of tools and microworlds are needed. After discussing general requirements for such programs, a prototypical ideal software system will be presented in detail. It will be illustrated how such a system could be used to construct learning environments and to support elementary data analysis with exploratory working style.     

A comparison of several approximations to the power function of the likelihood ratio test in covariance structure analysis*

In this paper we compare alternative asymptotic approximations to the power of the likelihood ratio test used in covariance structure analysis for testing the fit of a model. Alternative expressions for the noncentrality parameter (ncp) lead to different approximations to the power function. It appears that for alternative covariance matrices close to the null hypothesis, the alternative ncp's lead to similar values, while for alternative covariance matrices far from H_o the different expressions for the ncp can conflict substantively. Monte Carlo evidence shows that the ncp proposed in Satorra and Saris (1985) gives the most accurate power approximations.     

Bayesian MCMC Mapping of Quantitative Trait Loci in a Half-sib Design: a Graphical Model Perspective

Graphical models provide a powerful and flexible approach to the analysis of complex problems in genetics. While task-specific software may be extremely efficient for any particular analysis, it is often difficult to adapt to new computational challenges. By viewing these genetic applications in a more general framework, many problems can be handled by essentially the same software. This is advantageous in an area where fast methodological development is essential. Once a method has been fully developed and tested, problem-specific software may then be required. The aim of this paper is to illustrate the potential use of a graphical model approach to genetic analyses by taking a very simple and well-understood problem by way of example.     

MANAGING VENDOR INVENTORY IN A DUAL LEVEL DISTRIBUTION SYSTEM

Collaborative arrangements among members of the supply chain have received a great deal of interest in recent years as a means of reducing costs. One such arrangement is vendor managed inventory (VMI). VMI allows the vendor to make decisions concerning the quantity and timing of deliveries to the retailer. Such an arrangement offers the potential of a more efficient supply chain by removing the negative effects of retail ordering policies. A thorough review of the literature was conducted to identify factors likely to impact the performance of a VMI partnership. Computer simulation was used to study the effects of these factors from both the vendor's and retailer's perspectives. The results lend insight into the performance of VMI and guidance for managers as to the environments in which VMI is most effective.     

Testing equality of variances in the analysis of repeated measurements

The problem of comparing the precisions of two instruments using repeated measurements can be cast as an extension of the Pitman-Morgan problem of testing equality of variances of a bivariate normal distribution. Hawkins (1981) decomposes the hypothesis of equal variances in this model into two subhypotheses for which simple tests exist. For the overall hypothesis he proposes to combine the tests of the subhypotheses using Fisher's method and empirically compares the component tests and their combination with the likelihood ratio test. In this paper an attempt is made to resolve some discrepancies and puzzling conclusions in Hawkins's study and to propose simple modifications.
The new tests are compared to the tests discussed by Hawkins and to each other both in terms of the finite sample power (estimated by Monte Carlo simulation) and theoretically in terms of asymptotic relative efficiencies.     

基于PCAIDS模型的单边价格效应模拟——以国际铁矿石巨头力拓与必和必拓拟议的兼并为例

本文基于爱泼斯坦和鲁宾菲尔德提出的PCAIDS 模型,模拟了国际铁矿石生产和出口巨头力拓与必和必拓之间2007 年10 月提出的兼并的单边效应.研究发现,该兼并对世界铁矿石市场价格将产生重要影响,特别是兼并后形成的新企业将大幅度提高其产品的价格.兼并也会引起印度、巴西和南非铁矿石提价,尽管幅度要比两拓要小一些.中国的进口铁矿石主要来自于两拓、巴西、印度和南非,因此,如果两拓兼并将极大地提高我国进口铁矿石的成本.     

基于超高频数据的日内风险价值度量研究

随着金融市场的快速发展,传统的以日为单位的风险价值（VaR）已无法满足金融风险管理的需求,计算持有期小于1天的日内风险价值（Intraday VaR）显得愈加重要。文中对日内风险价值测度的方法进行了梳理、细化和改进,对测度中细节给予更加充分的考虑,最后结合我国股市特点对日内风险价值测度进行了实证研究。     

Semitractability of optimal stopping problems via a weighted stochastic mesh algorithm

In this paper, we propose a Weighted Stochastic Mesh (WSM) algorithm for approximating the value of discrete‐ and continuous‐time optimal stopping problems. In this context, we consider tractability of such problems via a useful notion of semitractability and the introduction of a tractability index for a particular numerical solution algorithm. It is shown that in the discrete‐time case the WSM algorithm leads to semitractability of the corresponding optimal stopping problem in the sense that its complexity is bounded in order by with being the dimension of the underlying Markov chain. Furthermore, we study the WSM approach in the context of continuous‐time optimal stopping problems and derive the corresponding complexity bounds. Although we cannot prove semitractability in this case, our bounds turn out to be the tightest ones among the complexity bounds known in the literature. We illustrate our theoretical findings by a numerical example.     

Azéma martingales for Bessel and CIR processes and the pricing of Parisian zero‐coupon bonds

In this paper, we study the excursions of Bessel and Cox–Ingersoll–Ross (CIR) processes with dimensions . We obtain densities for the last passage times and meanders of the processes. Using these results, we prove a variation of the Azéma martingale for the Bessel and CIR processes based on excursion theory. Furthermore, we study their Parisian excursions, and generalize previous results on the Parisian stopping time of Brownian motion to that of the Bessel and CIR processes. We obtain explicit formulas and asymptotic results for the densities of the Parisian stopping times, and develop exact simulation algorithms to sample the Parisian stopping times of Bessel and CIR processes. We introduce a new type of bond, the zero‐coupon Parisian bond. The buyer of such a bond is betting against zero interest rates, while the seller is effectively hedging against a period where interest rates fluctuate around 0. Using our results, we propose two methods for pricing these bonds and provide numerical examples.