2000 character limit reached
Robust hedging and pathwise calculus
Published 24 Oct 2011 in math.PR | (1110.5202v3)
Abstract: We study the connections of two different pathwise hedging approaches. These approaches are BSV by Bender-Sottinen-Valkeila and CF by Cont-Fourni\'e. We prove that both approaches give the same pathwise hedges, whenever both of the strategies exist. We also prove BSV type robust replication result for CF strategies.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.