Asymptotic Synthesis of Contingent Claims in a Sequence of Discrete-Time Markets

Author(s):  
David M. Kreps ◽  
W. Schachermayer
2000 ◽  
Vol 10 (1) ◽  
pp. 53-75 ◽  
Author(s):  
Steve Heston ◽  
Guofu Zhou

2009 ◽  
Author(s):  
Sanjay P. Bhat ◽  
Vijaysekhar Chellaboina ◽  
Anil Bhatia

Author(s):  
Peter Christoffersen ◽  
Redouane Elkamhi ◽  
Kris Jacobs

2021 ◽  
Vol 16 (1) ◽  
pp. 25-47
Author(s):  
David M. Kreps ◽  
Walter Schachermayer

We examine the connection between discrete‐time models of financial markets and the celebrated Black–Scholes–Merton (BSM) continuous‐time model in which “markets are complete.” Suppose that (a) the probability law of a sequence of discrete‐time models converges to the law of the BSM model and (b) the largest possible one‐period step in the discrete‐time models converges to zero. We prove that, under these assumptions, every bounded and continuous contingent claim can be asymptotically synthesized, controlling for the risks taken in a manner that implies, for instance, that an expected‐utility‐maximizing consumer can asymptotically obtain as much utility in the (possibly incomplete) discrete‐time economies as she can at the continuous‐time limit. Hence, in economically significant ways, many discrete‐time models with frequent trading resemble the complete‐markets model of BSM.


Sign in / Sign up

Export Citation Format

Share Document