Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Risk-Sharing problem under limited liability constraints in a single-period model
94
0
0.0
(
0
)
Authors
Jessica Martin
Ask ChatGPT about the research
No Arabic abstract
This work provides analysis of a variant of the Risk-Sharing Principal-Agent problem in a single period setting with additional constant lower and upper bounds on the wage paid to the Agent. First the effect of the extra constraints on optimal contract existence is analyzed and leads to conditions on utilities under which an optimum may be attained. Solution characterization is then provided along with the derivation of a Borch rule for Limited Liability. Finally the CARA utility case is considered and a closed form optimal wage and action are obtained. This allows for analysis of the classical CARA utility and gaussian setting.
rate research
Read More
In this paper, we consider a Markov chain choice model with single transition. In this model, customers arrive at each product with a certain probability. If the arrived product is unavailable, then the seller can recommend a subset of available products to the customer and the customer will purchase one of the recommended products or choose not to purchase with certain transition probabilities. The distinguishing features of the model are that the seller can control which products to recommend depending on the arrived product and that each customer either purchases a product or leaves the market after one transition. We study the assortment optimization problem under this model. Particularly, we show that this problem is generally NP-Hard even if each product could only transit to at most two products. Despite the complexity of the problem, we provide polynomial time algorithms for several special cases, such as when the transition probabilities are homogeneous with respect to the starting point, or when each product can only transit to one other product. We also provide a tight performance bound for revenue-ordered assortments. In addition, we propose a compact mixed integer program formulation that can solve this problem of large size. Through extensive numerical experiments, we show that the proposed algorithms can solve the problem efficiently and the obtained assortments could significantly improve the revenue of the seller than under the Markov chain choice model.
In order to anticipate rare and impactful events, we propose to quantify the worst-case risk under distributional ambiguity using a recent development in kernel methods -- the kernel mean embedding. Specifically, we formulate the generalized moment problem whose ambiguity set (i.e., the moment constraint) is described by constraints in the associated reproducing kernel Hilbert space in a nonparametric manner. We then present the tractable approximation and its theoretical justification. As a concrete application, we numerically test the proposed method in characterizing the worst-case constraint violation probability in the context of a constrained stochastic control system.
We consider the problem of finding Pareto-optimal allocations of risk among finitely many agents. The associated individual risk measures are law invariant, but with respect to agent-dependent and potentially heterogeneous reference probability measures. Moreover, individual risk assessments are assumed to be consistent with the respective second-order stochastic dominance relations. We do not assume their convexity though. A simple sufficient condition for the existence of Pareto optima is provided. Its proof combines local comonotone improvement with a Dieudonne-type argument, which also establishes a link of the optimal allocation problem to the realm of collapse to the mean results. Finally, we extend the results to capital requirements with multidimensional security markets.
In this paper we study a class of risk-sensitive Markovian control problems in discrete time subject to model uncertainty. We consider a risk-sensitive discounted cost criterion with finite time horizon. The used methodology is the one of adaptive robust control combined with machine learning.
This paper considers an optimal control of a big financial company with debt liability under bankrupt probability constraints. The company, which faces constant liability payments and has choices to choose various production/business policies from an available set of control policies with different expected profits and risks, controls the business policy and dividend payout process to maximize the expected present value of the dividends until the time of bankruptcy. However, if the dividend payout barrier is too low to be acceptable, it may result in the companys bankruptcy soon. In order to protect the shareholders profits, the managements of the company impose a reasonable and normal constraint on their dividend strategy, that is, the bankrupt probability associated with the optimal dividend payout barrier should be smaller than a given risk level within a fixed time horizon. This paper aims at working out the optimal control policy as well as optimal return function for the company under bankrupt probability constraint by stochastic analysis, PDE methods and variational inequality approach. Moreover, we establish a risk-based capital standard to ensure the capital requirement of can cover the total given risk by numerical analysis and give reasonable economic interpretation for the results.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
