{'fraction_non_alphanumeric': 0.019762845849802372, 'fraction_numerical': 0.0013175230566534915, 'mean_word_length': 5.495726495726496, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Using Dynamic Programming to Optimally Rebalance Portfolios

The authors propose a different framework that quantifies the cost of a rebalancing strategy in terms of risk-adjusted returns net of transaction costs. They then derive an optimal rebalancing strategy that actively seeks to minimize that cost. Certainty equivalents and the transaction costs associated with a policy to define a cost-to-go function are used, with the expected cost-to-go minimized using dynamic programming. They apply Monte Carlo simulations to demonstrate that their method outperforms traditional rebalancing strategies like monthly, quarterly, annual, and 5% tolerance rebalancing. They also show the robustness of our method to model error by performing sensitivity analyses.