This note concerns Markov decision processes on a discrete state space. It is supposed that the reward function is nonnegative, and that the decision maker has a nonnull constant risk-sensitivity, which leads to grade random rewards via the expectation of an exponential utility function. The...

We review the main results in the theory of quadratic hedging in a general incomplete model of continuous trading with semimartingale price process. The objective is to hedge contingent claims by using portfolio strategies. We describe two types of criteria: the so-called (local)...

In this paper a discrete-continuous project scheduling problem is considered. In this problem activities simultaneously require discrete and continuous resources. The processing rate of each activity depends on the amount of the continuous resource allotted to this activity at a time. All the...

The current paper presents a short survey of stochastic models of risk control and dividend optimization techniques for a financial corporation. While being close to consumption/investment models of Mathematical Finance, dividend optimization models possess special features which do not allow...

A class of cooperative TU-games arising from shortest path problems is introduced and analyzed. Some conditions under which a shortest path game is balanced are obtained. Also an axiomatic characterization of the Shapley value for this class of games is provided. Copyright Springer-Verlag Berlin...

The paper studies connections between arbitrage and utility maximization in a discrete-time financial market. The market is incomplete. Thus one has several choices of equivalent martingale measures to price contingent claims. Davis determines a unique price for a contingent claim which is based...

The aim of this note is to provide a unified theory of all compromise values defined as the τ-value in cooperative game theory. The so-called covariance property plays a crucial role in our approach and, related to this property, a family of covariant compromise values is introduced. The...

For more than two machines, and when preemption is forbidden, the computation of minimum makespan schedules for the open-shop problem is NP-hard. Compared to the flow-shop and the job-shop, the open-shop has free job routes which lead to a much larger solution space, to smaller gaps between the...

We consider constrained discounted-cost Markov control processes in Borel spaces, with unbounded costs. Conditions are given for the constrained problem to be solvable, and also equivalent to an equality-constrained (EC) linear program. In addition, it is shown that there is no duality gap...

In the context of stochastic resource-constrained project scheduling we introduce a novel class of scheduling policies, the linear preselective policies. They combine the benefits of preselective policies and priority policies; two classes that are well known from both deterministic and...