As the energy market has grown in importance in recent decades, researchers have paid increasing attention to swing option contracts. Early studies evaluated the swing contract as if it were a financial derivative contract, by ignoring its storage constraints. Aided by recent advances in...

In this study, we use the dynamic programming method introduced by Mirică (2004) to solve the well-known war game of attrition and attack as formulated by Isaacs (1965). By using this modern approach, we extend the classical framework to explore optimal strategies within the differential game...

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and...

This paper develops an approximate closed-form optimal portfolio allocation formula for a spot asset whose variance follows a GARCH(1,1) process. We consider an investor with constant relative risk aversion (CRRA) utility who wants to maximize the expected utility from terminal wealth under a...

We use dynamic programming, finite elements, and parallel computing to design and evaluate two-dimensional financial derivatives. Our dynamic program is flexible, as it divides the evaluation process into two components: one related to the dynamics of the underlying process and the other to the...

We present the Forest of Stochastic Trees (FOST) method for pricing multiple exercise options by simulation. The proposed method uses stochastic trees in place of binomial trees in the Forest of Trees algorithm originally proposed to value swing options, hence extending that method to allow for...

This paper studies a dynamic quantile model for intertemporal decisions under uncertainty, in which the decision maker maximizes the τ-quantile of the stream of future utilities, for τ ∈ (0,1). We present two sets of contributions. First, we generalize existing results in directions that are...

A stochastic difference game is considered in which a player wants to minimize the time spent by a controlled one-dimensional symmetric random walk {𝑋𝑛,𝑛=0,1,…} in the continuation region 𝐶:={1,2,…}, and the second player seeks to maximize the survival time in C. The process...

This paper is devoted to the development of heuristics for the dynamic pricing problem. A discrete time model of dynamic pricing on the fixed time horizon is proposed. It is applicable to products that satisfy two properties: 1) product value expires at a certain predetermined date, and 2)...