Dynamic Programming Models and Algorithms for the Mutual Fund Cash Balance Problem

被引:26
|
作者
Nascimento, Juliana [1 ]
Powell, Warren [1 ]
机构
[1] Princeton Univ, Dept Operat Res & Financial Engn, Princeton, NJ 08540 USA
关键词
mutual fund cash balance; approximate dynamic programming; FLOW MANAGEMENT; PERFORMANCE;
D O I
10.1287/mnsc.1100.1143
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Fund managers have to decide the amount of a fund's assets that should be kept in cash, considering the trade-off between being able to meet shareholder redemptions and minimizing the opportunity cost from lost investment opportunities. In addition, they have to consider redemptions by individuals as well as institutional investors, the current performance of the stock market and interest rates, and the pattern of investments and redemptions that are correlated with market performance. We formulate the problem as a dynamic program, but this encounters the classic curse of dimensionality. To overcome this problem, we propose a provably convergent approximate dynamic programming algorithm. We also adapt the algorithm to an online environment, requiring no knowledge of the probability distributions for rates of return and interest rates. We use actual data for market performance and interest rates, and demonstrate the quality of the solution (compared to the optimal) for the top 10 mutual funds in each of nine fund categories. We show that our results closely match the optimal solution (in considerably less time), and outperform two static (newsvendor) models. The result is a simple policy that describes when money should be moved into and out of cash based on market performance.
引用
下载
收藏
页码:801 / 815
页数:15
相关论文
共 50 条
  • [21] Dynamic programming algorithms for the mosaic longest common subsequence problem
    Huang, Kuo-Si
    Yang, Chang-Biau
    Tseng, Kuo-Tsung
    Peng, Yung-Hsing
    Ann, Hsing-Yen
    INFORMATION PROCESSING LETTERS, 2007, 102 (2-3) : 99 - 103
  • [22] The simplified partial digest problem: Enumerative and dynamic programming algorithms
    Blazewicz, Jacek
    Burke, Edmund K.
    Kasprzak, Marta
    Kovalev, Alexandr
    Kovalyov, Mikhail Y.
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2007, 4 (04) : 668 - 680
  • [23] Nonlinear programming reformulation of dynamic flux balance analysis models
    de Oliveira, Rafael D.
    Le Roux, Galo A. C.
    Mahadevan, Radhakrishnan
    COMPUTERS & CHEMICAL ENGINEERING, 2023, 170
  • [24] Mutual fund competition in the presence of dynamic flows
    Breton, Michele
    Hugonnier, Julien
    Masmoudi, Tarek
    AUTOMATICA, 2010, 46 (07) : 1176 - 1185
  • [25] Multifactor models in the analysis of mutual fund effectiveness
    Filip, Dariusz
    PROBLEMY ZARZADZANIA-MANAGEMENT ISSUES, 2018, 16 (03): : 61 - 81
  • [26] Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
    Nixon, Tanner
    Curry, Robert M.
    Allaissem B., Phanuel
    Computers and Operations Research, 2025, 175
  • [27] STOCHASTIC CASH BALANCE PROBLEM WITH CHARGES LEVIED AGAINST BALANCE
    PORTEUS, EL
    NEAVE, EH
    MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (11): : 600 - 602
  • [28] Dynamic programming approximation algorithms for the capacitated lot-sizing problem
    Buyuktahtakin, I. Esra
    Liu, Ning
    JOURNAL OF GLOBAL OPTIMIZATION, 2016, 65 (02) : 231 - 259
  • [29] Comparative Analysis of the Efficiency of Various Dynamic Programming Algorithms for the Knapsack Problem
    Posypkin, Mikhail
    Si Thu Thant Sin
    PROCEEDINGS OF THE 2016 IEEE NORTH WEST RUSSIA SECTION YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING CONFERENCE (ELCONRUSNW), 2016, : 313 - 316
  • [30] Dynamic programming approximation algorithms for the capacitated lot-sizing problem
    İ. Esra Büyüktahtakın
    Ning Liu
    Journal of Global Optimization, 2016, 65 : 231 - 259