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...

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...

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...

The computational time required to solve and estimate dynamic economic models is one of the main constraints in empirical research. The Endogenous Grid Method (EGM) proposed by Carroll (2006) is known to offer impressive speed gains over more traditional stochastic dynamic programming methods,...

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...

Are the serves of the world’s best tennis pros consistent with the theoretical predictions of Nash equilibrium in mixed strategies? We analyze their serve direction choices (to the receiver’s left, right or body) with data from an online database called the Match Charting Project. Using a...

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)...

We introduce a fast upper-envelope scan (FUES) method to compute solutions for dynamic programming problems with continuous and discrete choices. The FUES method builds on the standard endogenous grid method (EGM). Standard EGM applied to problems with continuous and discrete choices does not by...

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...

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...

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...