Utility Maximization in Imperfected Markets
AbstractWe analyze a problem of maximization of expected terminal wealth and consumption in markets with some ``imperfection'', such as constraints on the permitted portfolios, labor income, or/and nonlinearity of portfolio dynamics. By using general optional decomposition under constraints in multiplicative form, we develop a dual formulation. Then, under some conditions imposed on the model setting and the utility functions, we are able to prove an existence and uniqueness of an optimal solution to primal and to the corresponding dual problem by convex duality.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by EconWPA in its series Finance with number 0301007.
Length: 41 pages
Date of creation: 21 Jan 2003
Date of revision: 22 Jan 2003
Note: Type of Document - Tex/WordPerfect/Handwritten; prepared on IBM PC - PC-TEX/UNIX Sparc TeX; to print on HP/PostScript/Franciscan monk; pages: 41; figures: included/request from author/draw your own
Contact details of provider:
Web page: http://184.108.40.206
Stochastic Optimization; Utility Optimization; Duality Theory; Convex and State Constraints; Optional Decomposition; Optimal Stopping;
Find related papers by JEL classification:
- G11 - Financial Economics - - General Financial Markets - - - Portfolio Choice; Investment Decisions
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA).
If references are entirely missing, you can add them using this form.