<--- Back to Details
First PageDocument Content
Mathematical finance / Stochastic volatility / Volatility / BlackScholes model / Convexity / Futures contract / Autoregressive conditional heteroskedasticity / Stochastic process / Convex function / Convex set
Date: 2014-02-02 05:57:49
Mathematical finance
Stochastic volatility
Volatility
BlackScholes model
Convexity
Futures contract
Autoregressive conditional heteroskedasticity
Stochastic process
Convex function
Convex set

General Properties of Option Prices Yaacov Z. Bergman1 , Bruce D. Grundy2 and Zvi Wiener3 Forthcoming: The Journal of Finance First Draft: February 1995 Current Draft: January

Add to Reading List

Source URL: pluto.mscc.huji.ac.il

Download Document from Source Website

File Size: 332,44 KB

Share Document on Facebook

Similar Documents

Hausdorff Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is

Hausdorff Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is

DocID: 1vjVY - View Document

Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals∗ Markus Bl¨aser1 Bodo Manthey2

Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals∗ Markus Bl¨aser1 Bodo Manthey2

DocID: 1rtnz - View Document

REVIEW SHEET FOR FINAL: ADVANCED MATH 195, SECTION 59 (VIPUL NAIK) To maximize efficiency, please bring a copy (print or readable electronic) of this review sheet to all review sessions. 1. Directional derivatives and gr

REVIEW SHEET FOR FINAL: ADVANCED MATH 195, SECTION 59 (VIPUL NAIK) To maximize efficiency, please bring a copy (print or readable electronic) of this review sheet to all review sessions. 1. Directional derivatives and gr

DocID: 1rrJ2 - View Document

CS168: The Modern Algorithmic Toolbox Lecture #18: Linear and Convex Programming, with Applications to Sparse Recovery Tim Roughgarden & Gregory Valiant∗ May 25, 2016

CS168: The Modern Algorithmic Toolbox Lecture #18: Linear and Convex Programming, with Applications to Sparse Recovery Tim Roughgarden & Gregory Valiant∗ May 25, 2016

DocID: 1rjsj - View Document

ONE-ONE FUNCTIONS AND INVERSES MATH 152, SECTION 55 (VIPUL NAIK) Corresponding material in the book: Section 7.1. What students should definitely get: The definition of one-to-one function, the computational and checking

ONE-ONE FUNCTIONS AND INVERSES MATH 152, SECTION 55 (VIPUL NAIK) Corresponding material in the book: Section 7.1. What students should definitely get: The definition of one-to-one function, the computational and checking

DocID: 1rfrF - View Document