اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the Existence of Shadow Prices
36
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
For utility maximization problems under proportional transaction costs, it has been observed that the original market with transaction costs can sometimes be replaced by a frictionless shadow market that yields the same optimal strategy and utility. However, the question of whether or not this indeed holds in generality has remained elusive so far. In this paper we present a counterexample which shows that shadow prices may fail to exist. On the other hand, we prove that short selling constraints are a sufficient condition to warrant their existence, even in very general multi-currency market models with possibly discontinuous bid-ask-spreads.
قيم البحث
اقرأ أيضاً
We investigate the general structure of optimal investment and consumption with small proportional transaction costs. For a safe asset and a risky asset with general continuous dynamics, traded with random and time-varying but small transaction costs
, we derive simple formal asymptotics for the optimal policy and welfare. These reveal the roles of the investors preferences as well as the market and cost dynamics, and also lead to a fully dynamic model for the implied trading volume. In frictionless models that can be solved in closed form, explicit formulas for the leading-order corrections due to small transaction costs are obtained.
We study the Markowitz portfolio selection problem with unknown drift vector in the multidimensional framework. The prior belief on the uncertain expected rate of return is modeled by an arbitrary probability law, and a Bayesian approach from filteri
ng theory is used to learn the posterior distribution about the drift given the observed market data of the assets. The Bayesian Markowitz problem is then embedded into an auxiliary standard control problem that we characterize by a dynamic programming method and prove the existence and uniqueness of a smooth solution to the related semi-linear partial differential equation (PDE). The optimal Markowitz portfolio strategy is explicitly computed in the case of a Gaussian prior distribution. Finally, we measure the quantitative impact of learning, updating the strategy from observed data, compared to non-learning, using a constant drift in an uncertain context, and analyze the sensitivity of the value of information w.r.t. various relevant parameters of our model.
To use neural networks in safety-critical settings it is paramount to provide assurances on their runtime operation. Recent work on ReLU networks has sought to verify whether inputs belonging to a bounded box can ever yield some undesirable output. I
nput-splitting procedures, a particular type of verification mechanism, do so by recursively partitioning the input set into smaller sets. The efficiency of these methods is largely determined by the number of splits the box must undergo before the property can be verified. In this work, we propose a new technique based on shadow prices that fully exploits the information of the problem yielding a more efficient generation of splits than the state-of-the-art. Results on the Airborne Collision Avoidance System (ACAS) benchmark verification tasks show a considerable reduction in the partitions generated which substantially reduces computation times. These results open the door to improved verification methods for a wide variety of machine learning applications including vision and control.
A new approach in stochastic optimization via the use of stochastic gradient Langevin dynamics (SGLD) algorithms, which is a variant of stochastic gradient decent (SGD) methods, allows us to efficiently approximate global minimizers of possibly compl
icated, high-dimensional landscapes. With this in mind, we extend here the non-asymptotic analysis of SGLD to the case of discontinuous stochastic gradients. We are thus able to provide theoretical guarantees for the algorithms convergence in (standard) Wasserstein distances for both convex and non-convex objective functions. We also provide explicit upper estimates of the expected excess risk associated with the approximation of global minimizers of these objective functions. All these findings allow us to devise and present a fully data-driven approach for the optimal allocation of weights for the minimization of CVaR of portfolio of assets with complete theoretical guarantees for its performance. Numerical results illustrate our main findings.
Kramkov and Sirbu (2006, 2007) have shown that first-order approximations of power utility-based prices and hedging strategies can be computed by solving a mean-variance hedging problem under a specific equivalent martingale measure and relative to a
suitable numeraire. In order to avoid the introduction of an additional state variable necessitated by the change of numeraire, we propose an alternative representation in terms of the original numeraire. More specifically, we characterize the relevant quantities using semimartingale characteristics similarly as in Cerny and Kallsen (2007) for mean-variance hedging. These results are illustrated by applying them to exponential Levy processes and stochastic volatility models of Barndorff-Nielsen and Shephard type.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
