Abstract
This paper analyzes the strategy that minimizes the initial cost of replicating a contingent claim in a market with transactions costs and trading constraints. The linear programming and two-stage backward recursive models developed are applicable to the replication of convex as well as nonconvex payoffs and to a portfolio of options with different maturities. The paper's formulation conveniently accounts for fixed and variable transactions costs, lot size constraints, and position limits on trading. The article shows that in the presence of trading frictions, it is no longer optimal to revise one's portfolio in each period. At the optimum, cash flows in excess of the desired ones may be generated. The optimal policy trades off the curvature of the payoff that is generated against the terminal slack.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: The Journal of Financial and Quantitative Analysis
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
