Decision making under uncertainty with unknown utility function and rank-ordered probabilities
We consider the ranking of decision alternatives in decision analysis problems under uncertainty, under very weak assumptions about the type of utility function and information about the probabilities of the states of nature. Namely, the following two assumptions are required for the suggested method: the utility function is in the class of increasing continuous functions, and the probabilities of the states of nature are rank-ordered. We develop a simple analytical method for the partial ranking of decision alternatives under the stated assumptions. This method does not require solving optimization programs and is free of the rounding errors.
We investigate a model of one-stage bidding between two differently informed stockmarket agents for a risky asset (share). The random liquidation price of a share may take two values: the integer positive m with probability p and 0 with probability 1−p. Player 1 (insider) is informed about the price, Player 2 is not. Both players know the probability p. Player 2 knows that Player 1 is an insider. Both players propose simultaneously their bids. The player who posts the larger bid buys one share from his opponent for this price. Any integer bids are admissible. The model is reduced to a zero-sum game with lack of information on one side. We construct the solution of this game for any p and m: we find the optimal strategies of both players and describe recurrent mechanism for calculating the game value. The results are illustrated by means of computer simulation.
It is proposed the model for constructing of flexible ratings by end-users and it is analyzed applying of special weights for indicating of consumer preferences by various factors depends on the considered object. There is developed an algorithm for the building of flexible ratings. Practical testing was carried out by applying of investment indicators.
We study Bertrand competition models with incomplete information about rivals' costs, where uncertainty is given by independent identically distributed random variables. It turns out that Bayesian Nash equilibria of the simplest of these games are described as Cournot prices. Then we discuss general conditions when Cournot prices give Bayesian Nash equilibria for Bertrand games with incomplete information about rivals' costs.
We consider the problem of selecting a predetermined number of objects from a given finite set. It is assumed that the preferences of the decisionmaker on this set are only partially known. Our solution approach is based on the notions of optimal and non-dominated subsets. The properties of such subsets and the objects they contain are investigated. The implementation of the developed approach is discussed and illustrated by various examples.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.
Existing approaches suggest that IT strategy should be a reflection of business strategy. However, actually organisations do not often follow business strategy even if it is formally declared. In these conditions, IT strategy can be viewed not as a plan, but as an organisational shared view on the role of information systems. This approach generally reflects only a top-down perspective of IT strategy. So, it can be supplemented by a strategic behaviour pattern (i.e., more or less standard response to a changes that is formed as result of previous experience) to implement bottom-up approach. Two components that can help to establish effective reaction regarding new initiatives in IT are proposed here: model of IT-related decision making, and efficiency measurement metric to estimate maturity of business processes and appropriate IT. Usage of proposed tools is demonstrated in practical cases.