Necessary and sufficient conditions for the existence and uniqueness of a solution of the so-called “unconditional” (UML) and the “conditional” (CML) maximum-likelihood estimation equations in the dichotomous Rasch model are given. The basic critical condition is essentially the same for UML and CML estimation. For complete data matrices A, it is formulated both as a structural property of A and in terms of the sufficient marginal sums. In case of incomplete data, the condition is equivalent to complete connectedness of a certain directed graph. It is shown how to apply the results in practical uses of the Rasch model.

The issue of compensation in multidimensional response modeling is addressed. We show that multidimensional response models are compensatory in their ability parameters if and only if they are monotone. In addition, a minimal set of assumptions is presented under which the MLEs of the ability parameters are also compensatory. In a recent series of articles, beginning with Hooker, Finkelman, and Schwartzman (2009) in this journal, the second type of compensation was presented as a paradoxical result for certain multidimensional response models, leading to occasional unfairness in maximum-likelihood test scoring. First, it is indicated that the compensation is not unique and holds generally for any multiparameter likelihood with monotone score functions. Second, we analyze why, in spite of its generality, the compensation may give the impression of a paradox or unfairness.

Financial data are as a rule asymmetric, although most econometric models are symmetric. This applies also to continuous-time models for high-frequency and irregularly spaced data. We discuss some asymmetric versions of the continuous-time GARCH model, concentrating then on the GJR-COGARCH model. We calculate higher-order moments and extend the first-jump approximation. These results are prerequisites for moment estimation and pseudo maximum likelihood estimation of the GJR-COGARCH model parameters, respectively, which we derive in detail.