Двухстадийная модель равновесного распределения транспортных потоков
This paper describes some previously unexamined features in a multistage approach to transport modelling. The approach described is based on a theorem on the potentiality of the special population game that arises while the model of equilibrium fl ow distribution over paths and the model of correspondence formation are combined.
In this paper we consider games with preference relations. The cooperative aspect of a game is connected with its coalitions. The main optimality concepts for such games are concepts of equilibrium and acceptance. We introduce a notion of coalition homomorphism for cooperative games with preference relations and study a problem concerning connections between equilibrium points (acceptable outcomes) of games which are in a homomorphic relation. The main results of our work are connected with finding of covariant and contravariant homomorphisms.
In this paper, we consider the following problem - what affects the amount of investment in knowledge when one of the network firms enters another innovation network. The solution of this problem will allow us to understand exactly how innovative companies will behave when deciding whether to enter the innovation network of another country or region, what conditions affect it and how the level of future investments in knowledge can be predicted.
The paper proposes a list of requirements for a game able to describe individually motivated social interactions: be non-cooperative, able to construct multiple coalitions in an equilibrium and incorporate intra and inter coalition externalities. For this purpose the paper presents a family of non-cooperative games for coalition structure construction with an equilibrium existence theorem for a game in the family. Few examples illustrate the approach. One of the results is that efficiency is not equivalent to cooperation as an allocation in one coalition. Further papers will demonstrate other applications of the approach.
In this paper we consider games with preference relations. The main optimality concept for such games is concept of equilibrium. We introduce a notion of homomorphism for games with preference relations and study a problem concerning connections between equilibrium points of games which are in a homomorphic relation. The main result is finding covariantly and contravariantly complete families of homomorphisms.
The ninth issue of annual Collection of articles consists of four sections: “Analysis of actual economic processes”, “Modeling of financial and market mechanisms”, “Dynamic models”, “Discussions, Notes and Letters”. As a whole nine articles are presented
In this paper, we consider the following problem - what affects the Nash equilibrium amount of investment in knowledge when some agents of the complete graph enter another full one. The solution of this problem will allow us to understand exactly how game agents will behave when deciding whether to enter the other net, what conditions and externalities affect it and how the level of future equilibrium amount of investments in knowledge can be predicted.
In Russia, chain stores have achieved considerable market power. In this work, we combine a Dixit–Stiglitz industry model with a monopolistic retailer in order to address the following questions: does the retailer always impair prices, variety of goods, and ultimately welfare? Which market structure is worse: Nash or Stackelberg? What should be the public policy in this area?
For n person games with preference relations some types of optimality solutions are introduced. Elementary properties of their solutions are considered. One sufficient condition for nonempty Ca-core is found.
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.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.