Efficient methods for computing investment strategies for multi-market commodity trading

The focus of this work is the computation of efficient strategies for commodity trading in a multimarket environment. In today's "global economy" commodities are often bought in one location and then sold (right away, or after some storage period) in different markets. Thus, a trading decision in one location must be based on expectations about future price curves in all other relevant markets, and on current and future storage and transportation costs. Investors try to compute a strategy that maximizes expected return, usually with some limitations on assumed risk. With standard stochastic assumptions on commodity price fluctuations, computing an optimal strategy can be modeled as a Markov decision process (MDP). However, in general, such a formulation does not lead to efficient algorithms. In this work a model for representing the multimarket trading problem is proposed and how to obtain efficient structured algorithms for computing optimal strategies is shown for a number of commonly used trading objective functions (expected net present value, mean-variance, and value at risk).

[1]  Robert Givan,et al.  Model Minimization in Markov Decision Processes , 1997, AAAI/IAAI.

[2]  H. Kushner,et al.  Decomposition of systems governed by Markov chains , 1974 .

[3]  Craig Boutilier,et al.  Decision-Theoretic Planning: Structural Assumptions and Computational Leverage , 1999, J. Artif. Intell. Res..

[4]  Eduardo S. Schwartz,et al.  Investment Under Uncertainty. , 1994 .

[5]  Thomas Dean,et al.  Decomposition Techniques for Planning in Stochastic Domains , 1995, IJCAI.

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[8]  Craig Boutilier,et al.  Abstraction and Approximate Decision-Theoretic Planning , 1997, Artif. Intell..

[9]  E. Prescott,et al.  Investment Under Uncertainty , 1971 .

[10]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[11]  Milos Hauskrecht,et al.  Computing Near Optimal Strategies for Stochastic Investment Planning Problems , 1999, IJCAI.

[12]  R. Bellman.  Dynamic programming. , 1957, Science.

[13]  Philippe Jorion.  Value at risk: the new benchmark for controlling market risk , 1996 .

[14]  R. Bellman,et al.  Dynamic Programming and Markov Processes , 1960 .

[15]  Daniel Hernández-Hernández,et al.  Risk Sensitive Markov Decision Processes , 1997 .

[16]  Milos Hauskrecht,et al.  Hierarchical Solution of Markov Decision Processes using Macro-actions , 1998, UAI.

[17]  Craig Boutilier,et al.  Exploiting Structure in Policy Construction , 1995, IJCAI.

[18]  Kee-Eung Kim,et al.  Solving Very Large Weakly Coupled Markov Decision Processes , 1998, AAAI/IAAI.

[19]  S. Vavasis.  Nonlinear optimization: complexity issues , 1991 .

[20]  Klaus Schittkowski,et al.  NLPQL: A fortran subroutine solving constrained nonlinear programming problems , 1986 .

[21]  Ronald A. Howard,et al.  Dynamic Programming and Markov Processes , 1960 .

[22]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..