排序方式: 共有32条查询结果,搜索用时 15 毫秒
1.
We reveal an interesting convex duality relationship between two problems: (a) minimizing the probability of lifetime ruin
when the rate of consumption is stochastic and the individual can invest in a Black–Scholes financial market; (b) a controller-and-stopper
problem, in which the controller controls the drift and volatility of a process in order to maximize a running reward based
on that process, and the stopper chooses the time to stop the running reward and pays the controller a final amount at that
time. Our primary goal is to show that the minimal probability of ruin, whose stochastic representation does not have a classical
form as does the utility maximization problem (i.e., the objective’s dependence on the initial values of the state variables
is implicit), is the unique classical solution of its Hamilton–Jacobi–Bellman (HJB) equation, which is a non-linear boundary-value
problem. We establish our goal by exploiting the convex duality relationship between (a) and (b). 相似文献
2.
We construct a sequence of functions that uniformly converge (on compact sets) to the price of an Asian option, which is written on a stock whose dynamics follow a jump diffusion. The convergence is exponentially fast. We show that each element in this sequence is the unique classical solution of a parabolic partial differential equation (not an integro‐differential equation). As a result we obtain a fast numerical approximation scheme whose accuracy versus speed characteristics can be controlled. We analyze the performance of our numerical algorithm on several examples. 相似文献
3.
We consider a framework for solving optimal liquidation problems in limit order books. In particular, order arrivals are modeled as a point process whose intensity depends on the liquidation price. We set up a stochastic control problem in which the goal is to maximize the expected revenue from liquidating the entire position held. We solve this optimal liquidation problem for power‐law and exponential‐decay order book models explicitly and discuss several extensions. We also consider the continuous selling (or fluid) limit when the trading units are ever smaller and the intensity is ever larger. This limit provides an analytical approximation to the value function and the optimal solution. Using techniques from viscosity solutions we show that the discrete state problem and its optimal solution converge to the corresponding quantities in the continuous selling limit uniformly on compacts. 相似文献
4.
Finance and Stochastics - In this paper, we study utility maximisation with proportional transaction costs. Assuming extended weak convergence of the underlying processes, we prove the convergence... 相似文献
5.
A new notion of equilibrium, which we call strong equilibrium, is introduced for time‐inconsistent stopping problems in continuous time. Compared to the existing notions introduced in Huang, Y.‐J., & Nguyen‐Huu, A. (2018, Jan 01). Time‐consistent stopping under decreasing impatience. Finance and Stochastics, 22(1), 69–95 and Christensen, S., & Lindensjö, K. (2018). On finding equilibrium stopping times for time‐inconsistent markovian problems. SIAM Journal on Control and Optimization, 56(6), 4228–4255, which in this paper are called mild equilibrium and weak equilibrium, respectively, a strong equilibrium captures the idea of subgame perfect Nash equilibrium more accurately. When the state process is a continuous‐time Markov chain and the discount function is log subadditive, we show that an optimal mild equilibrium is always a strong equilibrium. Moreover, we provide a new iteration method that can directly construct an optimal mild equilibrium and thus also prove its existence. 相似文献
6.
We solve the problem of optimal stopping of a Brownian motion subject to the constraint that the stopping time's distribution is a given measure consisting of finitely many atoms. In particular, we show that this problem can be converted to a finite sequence of state‐constrained optimal control problems with additional states corresponding to the conditional probability of stopping at each possible terminal time. The proof of this correspondence relies on a new variation of the dynamic programming principle for state‐constrained problems, which avoids measurable selections. We emphasize that distribution constraints lead to novel and interesting mathematical problems on their own, but also demonstrate an application in mathematical finance to model‐free superhedging with an outlook on volatility. 相似文献
7.
Strict local martingales may admit arbitrage opportunities with respect to the class of simple trading strategies. (Since
there is no possibility of using doubling strategies in this framework, the losses are not assumed to be bounded from below.)
We show that for a class of non-negative strict local martingales, the strong Markov property implies the no arbitrage property
with respect to the class of simple trading strategies. This result can be seen as a generalization of a similar result on
three dimensional Bessel process in Delbaen and Schachermayer (Math Finance 4:343–348, 1994). We also provide no arbitrage
conditions for stochastic processes within the class of simple trading strategies with shortsale restriction. 相似文献
8.
We simulate numerically a trade model with labor mobility costs added, modeled in such a way as to generate gross flows in excess of net flows. Adjustment to a trade shock can be slow with plausible parameter values. In our base case, the economy moves 95% of the distance to the new steady state in approximately eight years. Gross flows have a large effect on this rate of adjustment and on the normative effects of trade. Announcing and delaying the liberalization can build – or destroy – a constituency for free trade. We study the conditions under which these contrasting outcomes occur. 相似文献
9.
10.
We study optimal trade execution strategies in financial markets with discrete order flow. The agent has a finite liquidation horizon and must minimize price impact given a random number of incoming trade counterparties. Assuming that the order flow N is given by a Poisson process, we give a full analysis of the properties and computation of the optimal dynamic execution strategy. Extensions, whereby N is a Markov‐modulated compound Poisson process are also considered. We derive and compare the properties of the various cases and illustrate our results with computational examples. 相似文献