Problem of Multicurrency Deposit Diversification – Three Possible Approaches to Risk Accounting
The paper investigates possible ways to take into account risks, caused by uncertain factors, using the problem of optimal deposit diversification as an applied example. It is assumed that the investor (Decision Maker - DM) does not know future exchange rates at the end of the deposit period, and focuses only on some limits of their possible changes. Solution for this problem of decision-making under uncertainty depends on DM’s attitude to the risk\income. Various solutions - optimal with respect to guaranteed income, optimal with respect to guaranteed risk (Savage minimax regret solution), as well as a solution of a multiple-criteria problem with two criteria of equal importance, namely, risk and income, are obtained.
Keywords: Deposit Diversification, Uncertainty, Utility Function, Strategies, Outcomes, Risk by Savage, Multiple-Criteria Problems, Pareto Optimality.
Proceedings include extended abstracts of reports presented at the III International Conference on Optimization Methods and Applications “Optimization and application” (OPTIMA-2012) held in Costa da Caparica, Portugal, September 23—30, 2012.
Into the Red explores the emergence of a credit card market in post-Soviet Russia during the formative period from 1988 to 2007. In her analysis, Alya Guseva locates the dynamics of market building in the social structure, specifically the creative use of social networks. Until now, network scholars have overlooked the role that networks play in facilitating exchange in mass markets because they have exclusively focused on firm-to-firm or person-to-person ties. Into the Reddemonstrates how networks that combine individuals and organizations help to build markets for mass consumption. The book is situated on the cutting edge of emerging interdisciplinary research, linking multiple layers of analysis with institutional evolution. Using an intricate framework, Guseva chronicles both the creation of a credit card market and the making of a mass consumer. These processes are placed in the context of the ongoing restructuring in postcommunist Russia and the expansion of Western markets and ideologies through the rest of the world.
Supply chain management is rather new scientific field that reflects the concept of integrated business planning. This concept should be experts and practitioners in logistics and strategic management. Today, integrated planning to become a reality thanks to the development of information technology and computer technology. At the same time to achieve a competitive advantage is not enough high-speed, low-cost data transfer process. In order to effectively apply information technology tools necessary to develop a quantitative analysis of the effectiveness of supply chain management. The mam element of this tool are optimization models that reveal the complex interactions, the wave and the synergies that arise in supply chain management. In this article we consider one of the classes of such models - the so-called dynamic models of conveyor systems, processing of applications.
Uncertainty is a concept associated with data acquisition and analysis, usually appearing in the form of noise or measure error, often due to some technological constraint. In supervised learning, uncertainty affects classification accuracy and yields low quality solutions. For this reason, it is essential to develop machine learning algorithms able to handle efficiently data with imprecision. In this paper we study this problem from a robust optimization perspective. We consider a supervised learning algorithm based on generalized eigenvalues and we provide a robust counterpart formulation and solution in case of ellipsoidal uncertainty sets. We demonstrate the performance of the proposed robust scheme on artificial and benchmark datasets from University of California Irvine (UCI) machine learning repository and we compare results against a robust implementation of Support Vector Machines.
The paper focuses on the concept of ‘financial strategies’ and addresses two problems: first, how to define the concepts of financial strategy and strategizing, and second, how to operationalize them into indicators for empirical research. The introduction to this new concept is based on the conviction that strategizing (which is understood as a specific attitude to life held by people who do not live for the moment, think about their future even if it is rather uncertain, set long-term financial goals and act towards achieving them), is an intrinsic factor in the financial behavior of people. It is argued that it is not possible to define financial strategy or to operationalize it objectively and universally since people operate in very different circumstances; i.e. in different institutional environments or at different stages of life, etc. The solution must be found in the interactionist sociological perspective with the emphasis on the construction of the interpretation of a situation: how individuals themselves make sense of financial strategizing in their own environment, the options they perceive and the constraints they feel.
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.
Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.
Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.