Show simple item record

dc.contributor.advisorLeonid Kogan.en_US
dc.contributor.authorMyers, Jeremy D. (Jeremy Dale)en_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2011-02-23T15:00:37Z
dc.date.available2011-02-23T15:00:37Z
dc.date.copyright2009en_US
dc.date.issued2009en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/61296
dc.descriptionThesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.en_US
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (p. 87-88).en_US
dc.description.abstractIn the financial world, many quantitative investment managers have developed sophisticated statistical techniques to generate signals about expected returns from previous market data. However, the manner in which they apply this information to rebalancing their portfolios is often ad-hoc, trading off between rebalancing their assets into an allocation that generates the greatest expected return based on the generated signals and the incurred transaction costs that the reallocation will require. In this thesis, we develop an approximation to our investor's true value function which incorporates both return predictability and transaction costs. By optimizing our approximate value function at each time step, we will generate a portfolio strategy that closely emulates the optimal portfolio strategy, which is based on the true value function. In order to determine the optimal set of parameters for our approximate function which will generate the best overall portfolio performance, we develop a simulation-based method. Our computational implementation is verified against well-known base cases. We determine the optimal parameters for our approximate function in the single stock and bond case. In addition, we determine a confidence level on our simulation results. Our approximate function gives us useful insight into the optimal portfolio allocation in complex higher dimensional cases. Our function derivation and simulation methodology extend easily to portfolio allocation in higher dimensional cases, and we implement the modifications required to run these simulations. Simple cases are tested and more complex tests are specified for testing when appropriate dedicated computing resources are available.en_US
dc.description.statementofresponsibilityby Jeremy D. Myers.en_US
dc.format.extent88 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titlePortfolio optimization with transaction costs and preconceived portfolio weightsen_US
dc.typeThesisen_US
dc.description.degreeM.Eng.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc702644615en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record