Dynamic mean-variance problem: recovering time-consistency
buir.advisor | Ararat, Çağın | |
dc.contributor.author | Düzoylum, Seyit Emre | |
dc.date.accessioned | 2021-09-08T11:20:19Z | |
dc.date.available | 2021-09-08T11:20:19Z | |
dc.date.copyright | 2021-08 | |
dc.date.issued | 2021-08 | |
dc.date.submitted | 2021-09-06 | |
dc.description | Cataloged from PDF version of article. | en_US |
dc.description | Thesis (Master's): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2021. | en_US |
dc.description | Includes bibliographical references (leaves 76-78). | en_US |
dc.description.abstract | As the foundation of modern portfolio theory, Markowitz’s mean-variance port-folio optimization problem is one of the fundamental problems of financial math-ematics. The dynamic version of this problem in which a positive linear com-bination of the mean and variance objectives is minimized is known to be time-inconsistent, hence the classical dynamic programming approach is not applicable. Following the dynamic utility approach in the literature, we consider a less re-strictive notion of time-consistency, where the weights of the mean and variance are allowed to change over time. Precisely speaking, rather than considering a fixed weight vector throughout the investment period, we consider an adapted weight process. Initially, we start by extending the well-known equivalence be-tween the dynamic mean-variance and the dynamic mean-second moment prob-lems in a general setting. Thereby, we utilize this equivalence to give a complete characterization of a time-consistent weight process, that is, a weight process which recovers the time-consistency of the mean-variance problem according to our definition. We formulate the mean-second moment problem as a biobjective optimization problem and develop a set-valued dynamic programming principle for the biobjective setup. Finally, we retrieve back to the dynamic mean-variance problem under the equivalence results that we establish and propose a backward-forward dynamic programming scheme by the methods of vector optimization. Consequently, we compute both the associated time-consistent weight process and the optimal solutions of the dynamic mean-variance problem. | en_US |
dc.description.provenance | Submitted by Betül Özen (ozen@bilkent.edu.tr) on 2021-09-08T11:20:19Z No. of bitstreams: 1 10418696.pdf: 946264 bytes, checksum: c6eb183fd0d7b7296dc3a32010acbca4 (MD5) | en |
dc.description.provenance | Made available in DSpace on 2021-09-08T11:20:19Z (GMT). No. of bitstreams: 1 10418696.pdf: 946264 bytes, checksum: c6eb183fd0d7b7296dc3a32010acbca4 (MD5) Previous issue date: 2021-08 | en |
dc.description.statementofresponsibility | by Seyit Emre Düzoylum | en_US |
dc.format.extent | ix, 78 leaves : illustrations ; 30 cm. | en_US |
dc.identifier.itemid | B123937 | |
dc.identifier.uri | http://hdl.handle.net/11693/76500 | |
dc.language.iso | English | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Mean-variance problem | en_US |
dc.subject | Time-consistency | en_US |
dc.subject | Portfolio optimization | en_US |
dc.subject | Set-valued dynamic programming | en_US |
dc.subject | Vector optimization | en_US |
dc.title | Dynamic mean-variance problem: recovering time-consistency | en_US |
dc.title.alternative | Beklenti-değişinti problemi: zamanda tutarlılığın geri kazanımı | en_US |
dc.type | Thesis | en_US |
thesis.degree.discipline | Industrial Engineering | |
thesis.degree.grantor | Bilkent University | |
thesis.degree.level | Master's | |
thesis.degree.name | MS (Master of Science) |