Using computer simulation and a study of the asymptotic distribution, we consider the relative efficiency of M-estimates for the coefficients of the threshold autoregressive equation with respect to the least squares and least absolute deviation estimates. We assume that the updating sequence of the autoregressive equation can have Student’s, logistic, double exponential, normal, or contaminated normal distributions. We prove asymptotic normality of M-estimates with a convex loss function.

For the model of autoregression with a random coefficient, the estimate by the least absolute deviations (LAD) method was proved to be consistent and asymptotically normal. For the asymptotic relative efficiency of the estimate by the LAD method as compared to the least squares method, an analytical expression was obtained. For the case where the innovative field of the autoregression process has the Tukey distribution, consideration was given to the behavior of the relative asymptotic efficiency.

In situations when a group of people has to make a decision based on the set of individual preferences, they use a certain aggregation method, in particular, voting. One of the main problems for any non-dictatorial social choice rule is the possibility for the voters to achieve a more preferable outcome of the voting by misrepresenting their preferences. Such actions on behalf of the voters are called manipulation, or strategic voting. One approach used to compare social choice rules in terms of how hard they are to manipulate is to find the complexity classes of manipulation problems for a given aggregation method. In this work, we present a survey of the studies of complexity classes of manipulation problems under various model assumptions and constraints.

Opinion dynamics in network structures of special type are considered. Each node consists of two agents interacting with each other. The properties of consensus arising in such structures are studied using the DeGroot model.

The role of strategic IT consulting in consulting service lifecycle is determined. Practical issues of its basic directions such as strategic IT audit, IT strategy development, IT service organization and transfer to outsourcing, are discussed.

Twelve sets, proposed as social choice solution concepts, are compared: the core, five versions of the uncovered set, two versions of the minimal weakly stable sets, the uncaptured set, the untrapped set, the minimal undominated set (strong top cycle) and the minimal dominant set (weak top cycle). The main results presented are the following. 1) A criterion to determine whether an alternative belongs to a minimal weakly stable set is found. It establishes the logical connection between minimal weakly stable sets and covering relation. 2) In tournaments and in general case it is determined for all twelve sets, whether each two of them are related by inclusion or not. 3) In tournaments the concept of stability is employed to generalize the notions of weakly stable and uncovered sets. New concepts of k-stable alternatives and k-stable sets are introduced and their properties and mutual relations are explored. 4) A concept of the minimal dominant set is generalized. It helps to establish that in general case all dominant sets are ordered by strict inclusion. In tournaments the hierarchies of the classes of k-stable alternatives and k-stable sets combined with the system of dominant sets constitute tournament’s structure (“microstructure” and “macrostructure” respectively). This internal structure may be treated as a system of reference, which is based on difference in degrees of stability. An algorithm for calculating the minimal dominant sets and the classes of k-stable alternatives is also given.

The problem of binary classification is considered, an algorithm for its solution is proposed, based on the method of entropy-based estimation of the decision rule parameters. A detailed description of the entropy-based estimation method and the classification algorithm is given, the advantages and disadvantages of this approach are described, the results of numerical experiments and comparisons with the traditional support vector machine for classification accuracy and degree of dependence on the training sample size are presented.

The direct and inverse projections (DIP) method was proposed to reduce the feature space to the given dimensions oriented to the problems of randomized machine learning and based on the procedure of “direct” and “inverse” design. The “projector” matrices are determined by maximizing the relative entropy. It is suggested to estimate the information losses by the absolute error calculated with the use of the Kullback–Leibler function (SRC method). An example illustrating these methods was given.

This paper suggests a new randomized forecasting method based on entropy-robust estimation for the probability density functions (PDFs) of random parameters in dynamic models described by the systems of linear ordinary differential equations. The structure of the PDFs of the parameters and measurement noises with the maximal entropy is studied. We generate the sequence of random vectors with the entropy-optimal PDFs using a modification of the Ulam-von Neumann method. The developed method of randomized forecasting is applied to the world population forecasting problem.

This paper suggests a new randomized forecasting method based on entropy-robust estimation for the probability density functions (PDFs) of random parameters in dynamic models described by the systems of linear ordinary differential equations. The structure of the PDFs of the parameters and measurement noises with the maximal entropy is studied. We generate the sequence of random vectors with the entropy-optimal PDFs using a modification of the Ulam–von Neumann method. The developed method of randomized forecasting is applied to the world population forecasting problem.

In each node of a network, economy is described by the simple two-period Romer’s model of endogenous growth with production and knowledge externalities. The sum of knowledge levels in the neighbor nodes causes an externality in the production of each node of the network. The game equilibrium in the network is investigated. The agents’ solutions depending on the size of externality are obtained. The uniqueness of inner equilibrium is proved. The role of passive agents in network formation is studied; in particular, the possibilities of adding a passive agent to a regular network, and also of joining of regular networks through nodes with passive agents. It is shown that the sum of knowledge levels in all the nodes decreases under adding of a new link.

We consider LS-, LAD-, R-, M-, S-, LMS-, LTS-, MM-, and HBR-estimates for the parameters of a linear regression model with unknown noise distribution. With computer modeling for medium sized samples, we compare the accuracy of the considered estimates for the most popular probability distributions of noise in a regression model. For different noise distributions, we analytically compute asymptotic efficiencies of LS-, LAD-, R-, M-, S-, and LTS- estimates. We give recommendations for practical applications of these methods for different noise distributions in the model. We show examples on real datasets that support the advantages of robust estimates.

Foreword to the thematical issue devoted to the seventieth anniversary of Academician V.S. Tanaev

We consider a known test bench calibration scheme for a strapdown inertial navigation system (SDINS) that consists of sequential rotations of the SDINS on the test bench. We propose a mathematical formalization of this calibration scheme that lets us embed the calibration problem to stochastic Kalman setting of the estimation problem.

We consider an extension of the classical model of generalized Gale-Shapley matchings. The model describes a two-sided market: on one side, universities each of which has a restriction on the number of enrolled students; on the other side, applicants each of which can get a single place in the university. Both applicants and universities have preferences with respect to the desired distribution. We assume that each applicant constructs a linear order on the set of desired universities, and each university has preferences that are simplest semiorders For this modification, we show that a stable matching always exists. Moreover, we formulate necessary and sufficient conditions for Pareto optimality of the stable matching.

The problem of building the rating of a remote training system by processing the results of a run of tests was considered. The Rasch model extended to a run of tests was used. A recurrent algorithm based on the maximum-likelihood procedure and the Newton method was proposed to calculate the rating.