[We solve the dynamic mean-variance portfolio problem and derive its time-consistent solution using dynamic programming. Previous literature, in contrast, only determines either myopic or precommitment (committing to follow the initially optimal policy) solutions. We provide a fully analytical simple characterization of the dynamically optimal mean-variance portfolios within a general incomplete-market economy. We also identify a probability measure that incorporates intertemporal hedging demands and facilitates tractability. We illustrate this by easily computing portfolios explicitly under various stochastic investment opportunities. A calibration exercise shows that the meanvariance hedging demands are economically significant.]

Toronto and University of Warwick for helpful comments. All errors are our responsibility. Dynamic Mean-Variance Asset Allocation Mean-variance criteria remain prevalent in multi-period problems, and yet not much is known about their dynamically optimal policies. We provide a fully analytical characterization of the optimal dynamic mean-variance portfolios within a general incomplete-market economy, and recover a simple structure that also inherits several conventional properties of static models. We also identify a probability measure that incorporates intertemporal hedging demands and facilitates much tractability in the explicit computation of portfolios. We solve the problem by explicitly recognizing the time-inconsistency of the mean-variance criterion and deriving a recursive representation for it, which makes dynamic programming applicable. We further show that our time-consistent solution is generically different from the pre-commitment solutions in the extant literature, which maximize the mean-variance criterion at an initial date and which the investor commits to follow despite incentives to deviate. We illustrate the usefulness of our analysis by explicitly computing dynamic mean-variance portfolios under various stochastic investment opportunities in a straightforward way, which does not involve solving a Hamilton-Jacobi-Bellman