A greedy algorithm for habit formation under multiplicative utility
We consider the problem of optimizing lifetime consumption under a habit formation model, both with and without an exogenous pension. Unlike much of the existing literature, we apply a power utility to the ratio of consumption to habit, rather than to their difference. The martingale/duality method becomes intractable in this setting, so we develop a greedy version of this method that is solvable using Monte Carlo simulation. We investigate the behaviour of the greedy solution, and explore what parameter values make the greedy solution a good approximation to the optimal one.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Dual Formulation of the Optimal Consumption problem with Multiplicative Habit Formation
This paper provides a dual formulation of the optimal consumption problem with internal multiplicative habit formation. In this problem, the agent derives utility from the ratio of consumption to the internal habit compo…
A mean field game approach to equilibrium consumption under external habit formation
This paper studies the equilibrium consumption under external habit formation in a large population of agents. We first formulate problems under two types of conventional habit formation preferences, namely linear and mu…
Optimal consumption under loss-averse multiplicative habit-formation preferences
This paper studies a loss-averse version of the multiplicative habit formation preference and the corresponding optimal investment and consumption strategies over an infinite horizon. The agent's consumption preference i…
Sparse Optimization on General Atomic Sets: Greedy and Forward-Backward Algorithms
We consider the problem of sparse atomic optimization, where the notion of "sparsity" is generalized to meaning some linear combination of few atoms. The definition of atomic set is very broad; popular examples include t…
Scalable Greedy Feature Selection via Weak Submodularity
Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high.…
feature selection