Optimal Rebalancing: A Scalable Solution
نویسندگان
چکیده
Institutional investors usually employ mean-variance analysis to determine optimal portfolio weights. Almost immediately upon implementation, however, the portfolio’s weights become sub-optimal as changes in asset prices cause the portfolio to drift away from the optimal targets. We apply a quadratic heuristic to address the optimal rebalancing problem, and we compare it to a dynamic programming solution as well as to standard industry heuristics. The quadratic heuristic provides solutions that are remarkably close to the dynamic programming solution. Moreover, unlike the dynamic programming solution, the quadratic heuristic is scalable to as many as several hundreds assets.
منابع مشابه
Scalable, Efficient and Optimal Discrete-Time Rebalancing Algorithms for Log-Optimal Investment Portfolio
SCALABLE, EFFICIENT AND OPTIMAL DISCRETE-TIME REBALANCING ALGORITHMS FOR LOG-OPTIMAL INVESTMENT PORTFOLIO
متن کاملRobotic load balancing for mobility-on-demand systems
In this paper we develop methods for maximizing the throughput of a mobility-on-demand urban transportation system. We consider a finite group of shared vehicles, located at a set of stations. Users arrive at the stations, pick-up vehicles, and drive (or are driven) to their destination station where they drop-off the vehicle. When some origins and destinations are more popular than others, the...
متن کاملMIT Sloan School of Management MIT Sloan Working Paper 4641 - 07 March 2007 Portfolio Rebalancing : A Test of the Markowitz - van Dijk Heuristic
Institutional investors usually employ mean-variance analysis to determine optimal portfolio weights. Almost immediately upon implementation, however, the portfolio's weights become sub-optimal as changes in asset prices cause the portfolio to drift away from the optimal targets. In an idealized world without transaction costs investors would rebalance continually to the optimal weights. In the...
متن کاملLoad Balancing for Mobility-on-Demand Systems
In this paper we develop methods for maximizing the throughput of a mobility-on-demand urban transportation system. We consider a finite group of shared vehicles, located at a set of stations. Users arrive at the stations, pick-up vehicles, and drive (or are driven) to their destination station where they drop-off the vehicle. When some origins and destinations are more popular than others, the...
متن کاملCongestion-Aware Randomized Routing in Autonomous Mobility-on-Demand Systems
In this paper we study the routing and rebalancing problem for a fleet of autonomous vehicles providing ondemand transportation within a congested urban road network (that is, a road network where traffic speed depends on vehicle density). We show that the congestion-free routing and rebalancing problem is NP-hard and provide a randomized algorithm which finds a low-congestion solution to the r...
متن کامل