面板数据公共变点的非参数最大似然估计

Gao Pengli;Xia Zhiming(School of Mathematics,Northwest University,Xi'an 710127,China)     

部分结构突变的线性面板模型的变点估计

Han Jiao;Xia Zhiming(School of Mathematics,Northwest University,Xi'an 710127,China)     

���ն����ı�Ҷ˹���Ƽ���ͳ�Ʒ���

??The Bayesian model are established for the VaR and related risk measurements. The relationship between VaR and other risk measurements including expect shortfall, tail condition expectation and conditional value at risk are discussed. Furthermore, the Bayesian estimates and Bayesian predictors of these risk measurement are derived. Thirdly, the consistency and asymptotic normality in the exponential risk model are proved. Finally, the numerical simulation method is used to verify the convergence rate under different sample sizes.     

Strategy-proofness, solidarity, and consistency for multiple assignment problems

We consider a problem of allocating indivisible objects when agents may desire to consume more than one object and no monetary transfers are allowed. We are interested in allocation rules that satisfy desirable properties from an economic and social point of view. In addition to strategy-proofness and Pareto efficiency, we consider consistency and two solidarity properties (replacement-domination and population-monotonicity). In most of the cases, these properties are satisfied only by serially dictatorial rules. Received: November 1999/Final version: December 2001     

指数分布族中矩估计序贯置信区间

在矩估计的基础上,对于给定精度(2d)及置信系数(α),建立了对参数函数g(θ) 的一个序贯置信区间估计的程序．并讨论了在一定条件下,当d→0,它的渐近相合性、渐近有效性及有界的最优费用差(EN(d)-n(d))等渐近性质．     

A Fast Estimation Method for Mean Change Point in Massive Data Sets

When the sample size is $N$, the computational complexity of the least squares estimate of mean change point is O(N^2), and it's necessary to reduce the computational complexity in the case of huge data. In this paper, a two-stage fast scanning algorithm is proposed for the estimation of mean change point, and it is proved that this method has the same convergence speed and limiting distribution as the least squares estimation of mean change point, and the optimal complexity of the new algorithm is O(N^{4/3}\cdot b_n^{2/3}). We have conducted sufficient data experiments in terms of computation time and estimated efficiency, and the results show that the estimated efficiency of the new and old methods is similar, but the computation time of our method is obviously shortened.     

一般形式的密度估计

对于一般形式的核密度估计,我们指出ComposV.S.M.和DoreaC.C.Y.2001年论文中存在的几处错误,且给出了正确的结果及其证明.推广了一些有关文献中关于连续型密度和离散型分布核估计的若干结果.     

Subgame-consistent cooperative solutions in randomly furcating stochastic differential games

The paradigm of randomly-furcating stochastic differential games incorporates additional stochastic elements via randomly branching payoffs in stochastic differential games. This paper considers dynamically stable cooperative solutions in randomly furcating stochastic differential games. Analytically tractable payoff distribution procedures contingent upon specific random realizations of the state and payoff structure are derived. This new approach widens the application of cooperative differential game theory to problems where the evolution of the state and future environments are not known with certainty. Important cases abound in regional economic cooperation, corporate joint ventures and environmental control. An illustration in cooperative resource extraction is presented.     

NA、PA样本下密度核估计的相合性

设{Xn,n≥1}为同分布的NA或PA随机变量序列，f(x)为X1概率密度函数，基于样本X1，X2，…，Xn，本对密度函数（f(x)的核估计进行了讨论，在适当条件下证明了其强相合和r阶矩相合。     

Local bootstrap

The local bootstrap method draws bootstrap samples from a neighborhood of each data point. Unlike the common bootstrap, it is especially useful for heteroscedastic data. This paper considers local bootstrap of y for a data set {(x _i , y _i )} with the neighborhood defined by the window in a kernel regression model. It shows that for each x, the bootstrap distribution and moments converge almost surely to the true distribution and moments of y respectively, and this convergence is also uniform in x within the data set.