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 条
  • [31] Improved Dynamic Programming Algorithms for the 0-1 Knapsack Problem
    Meng, Xiaohua
    Zhu, Yue-an
    Wu, Xiaoming
    PROCEEDINGS OF 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (ICCSIT 2010), VOL 8, 2010, : 19 - 22
  • [32] Dynamic programming algorithms for the hi-objective integer knapsack problem
    Rong, Aiying
    Figueira, Jose Rui
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (01) : 85 - 99
  • [33] Integer programming models and algorithms for the graph decontamination problem with mobile agents
    Penuel, John
    Smith, J. Cole
    Shen, Siqian
    NETWORKS, 2013, 61 (01) : 1 - 19
  • [34] Mathematical programming models and algorithms for a class-faculty assignment problem
    Al-Yakoob, Salem M.
    Sherali, Hanif D.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) : 488 - 507
  • [35] EQUIVALENT FORMULATIONS OF STOCHASTIC CASH BALANCE PROBLEM
    PORTEUS, L
    MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 19 (03): : 250 - 253
  • [36] Genetic algorithms for the investment of the mutual fund with global trend indicator
    Tsai, Tsung-Jung
    Yang, Chang-Biau
    Peng, Yung-Hsing
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (03) : 1697 - 1701
  • [37] Stochastic dominance algorithms with application to mutual fund performance evaluation
    Venkataraman, Sree Vinutha
    Rao, S. V. D. Nageswara
    INTERNATIONAL JOURNAL OF FINANCE & ECONOMICS, 2023, 28 (01) : 681 - 698
  • [38] Cash Holding Decision Dynamic Programming Model
    Zhang, Jianguang
    Wang, Danmei
    INTERNATIONAL CONFERENCE ON ENGINEERING AND BUSINESS MANAGEMENT (EBM2011), VOLS 1-6, 2011, : 1718 - +
  • [39] MUTUAL FUND PORTFOLIO CHOICE IN THE PRESENCE OF DYNAMIC FLOWS
    Hugonnier, Julien
    Kaniel, Ron
    MATHEMATICAL FINANCE, 2010, 20 (02) : 187 - 227
  • [40] On the Use of Multifactor Models to Evaluate Mutual Fund Performance
    Huij, Joop
    Verbeek, Marno
    FINANCIAL MANAGEMENT, 2009, 38 (01) : 75 - 102