Institution
Central Economics and Mathematics Institute
Facility•Moscow, Russia•
About: Central Economics and Mathematics Institute is a facility organization based out in Moscow, Russia. It is known for research contribution in the topics: Population & Foreign-exchange reserves. The organization has 297 authors who have published 580 publications receiving 6449 citations. The organization is also known as: Federal State Institution of Science Central Economics and Mathematics Institute of the Russian Academy of Sciences.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, the authors investigated the term structure of zero coupon bonds when interest rates are driven by a general marked point process as well as by a Wiener process and proved the existence of a time-independent set of basic bonds.
Abstract: We investigate the term structure of zero coupon bonds when interest rates are driven by a general marked point process as well as by a Wiener process. Developing a theory that allows for measure–valued trading portfolios, we study existence and uniqueness of a martingale measure. We also study completeness and its relation to the uniqueness of a martingale measure. For the case of a finite jump spectrum we give a fairly general completeness result and for a Wiener–Poisson model we prove the existence of a time–independent set of basic bonds. We also give sufficient conditions for the existence of an affine term structure.
366 citations
••
TL;DR: In this paper, the authors describe the institutions and social norms that have accommodated corrup- tion in the Russian Federation in the post-transition years, and show how corruption is sustained by ill-defined boundaries between political and private business activity.
253 citations
••
TL;DR: It is shown that a market is approximately complete iff an equivalent martingale measure is unique and two constructions of stochastic integrals with respect to processes taking values in a space of continuous functions are suggested.
Abstract: To the memory of our friend and colleague Oliviero Lessi. Abstract. The main purpose of the paper is to provide a mathematical back- ground for the theory of bond markets similar to that available for stock markets. We suggest two constructions of stochastic integrals with respect to processes taking values in a space of continuous functions. Such integrals are used to define the evolution of the value of a portfolio of bonds corresponding to a trad- ing strategy which is a measure-valued predictable process. The existence of an equivalent martingale measure is discussed and HJM-type conditions are derived for a jump-diffusion model. The question of market completeness is considered as a problem of the range of a certain integral operator. We introduce a concept of approximate market completeness and show that a market is approximately complete iff an equivalent martingale measure is unique.
253 citations
••
TL;DR: This paper gives a new proof which uses techniques from stochastic calculus rather than functional analysis, and which removes any boundedness assumption.
Abstract: Let \({\cal Q}\) be the set of equivalent martingale measures for a given process \(S\), and let \(X\) be a process which is a local supermartingale with respect to any measure in \({\cal Q}\). The optional decomposition theorem for \(X\) states that there exists a predictable integrand \(\varphi\) such that the difference \(X-\varphi\cdot S\) is a decreasing process. In this paper we give a new proof which uses techniques from stochastic calculus rather than functional analysis, and which removes any boundedness assumption.
177 citations
••
TL;DR: One of out discoveries is that a cycle detection strategy of Tarjan greatly improves computational performance of a classical shortest path algorithm, making it competitive with the fastest known algorithms on a wide range of problems.
Abstract: We study the problem of finding a negative length cycle in a network. An algorithm for the negative cycle problem combines a shortest path algorithm and a cycle detection strategy. We survey cycle detection strategies, study various combinations of shortest path algorithms and cycle detection strategies and find the best combinations. One of out discoveries is that a cycle detection strategy of Tarjan greatly improves computational performance of a classical shortest path algorithm, making it competitive with the fastest known algorithms on a wide range of problems. As a part of out study, we develop problem families for testing negative cycle algorithms.
164 citations
Authors
Showing all 315 results
Name | H-index | Papers | Citations |
---|---|---|---|
Ruslan Dzarasov | 3 | 6 | 28 |
Tatiana Belkina | 3 | 9 | 46 |
Sergey Parinov | 3 | 11 | 25 |
Maxim Rybachuk | 3 | 8 | 31 |
V. I. Arkin | 3 | 12 | 33 |
Sergey G. Evsukov | 3 | 7 | 32 |
V. L. Makarov | 3 | 5 | 281 |
V L Levin | 2 | 2 | 15 |
Venera A. Karpinskaya | 2 | 3 | 9 |
V. Y. Bortalevich | 2 | 2 | 12 |
Alexander D. Slastnikov | 2 | 7 | 23 |
D I Piontkovskii | 2 | 2 | 11 |
Alexander I. Sotskov | 2 | 7 | 41 |
A. K. Romanov | 2 | 2 | 10 |
S. I. Parinov | 2 | 2 | 9 |