亚式期权二叉树matlab-M文件.txt资料文档下载
《亚式期权二叉树matlab-M文件.txt资料文档下载》由会员分享,可在线阅读,更多相关《亚式期权二叉树matlab-M文件.txt资料文档下载(3页珍藏版)》请在冰点文库上搜索。
![亚式期权二叉树matlab-M文件.txt资料文档下载](https://file1.bingdoc.com/fileroot1/2023-4/29/b5daafc9-ca4f-4221-856d-485bf836c744/b5daafc9-ca4f-4221-856d-485bf836c7441.gif)
%deltaT�����ҵ������ÿ
�ڵ�ʱ����
%sigma����������
%r����������
%n��������
%function[valuetree,Asianoption]=AOPBT(S,E,deltaT,sigma,r,n)
S=100;
E=105;
deltaT=0.1;
sigma=0.5;
r=0.1;
n=100;
%-------------------------��������������(ԭʼ��ʽ)
u=exp(r*deltaT+sigma*sqrt(deltaT));
d=1/u;
p=(1+r-d)/(u-d);
q=1-p;
%-------------------------������ʽһ
%q=0.5;
%a=exp(r*deltaT);
%d=a-a*sqrt(exp(sigma^2*deltaT)-1);
%u=a+a*sqrt(exp(sigma^2*deltaT)-1);
%-------------------------������ʽ��
%d=a-sigma*sqrt(deltaT);
%u=a+sigma*sqrt(deltaT);
%d=exp((r-sigma^2/2)*deltaT-sigma*sqrt(deltaT));
%u=exp((r-sigma^2/2)*deltaT+sigma*sqrt(deltaT));
%==========================������ڵ��ֵS��������ʽ��=========================
valuetree=zeros(n+1);
valuetree(1,1)=S;
fori=1:
n
forj=0:
i
valuetree(i+1,j+1)=S*u^j*d^(i-j);
end
end
%====================��������ڵ����·
���ľ�ֵ==============================
avgVinEachPath(1,1)=S;
fori=2:
n+1
height=i*(i-1)/2;
%ÿ
�еĵ�һ���ڵ�����һ���ڵ�
avgVinEachPath(height+1,1)=(avgVinEachPath(i-1,1)*(i-1)+valuetree(i,1))/i;
avgVinEachPath(height+i,1)=(avgVinEachPath(i-1,1)*(i-1)+valuetree(i,i))/i;
���е������ڵ�
forj=2:
i-1
npLc=(i-1)*(i-2)/2+j-1;
npRc=npLc+1;
Ll=length(find(avgVinEachPath(npLc,:
)>
0));
Rl=length(find(avgVinEachPath(npRc,:
count=1;
forLk=1:
Ll
avgVinEachPath(height+j,count)=(avgVinEachPath(npLc,Lk)*(i-1)+valuetree(i,j))/i;
count=count+1;
end
forRk=1:
Rl
avgVinEachPath(height+j,count)=(avgVinEachPath(npRc,Rk)*(i-1)+valuetree(i,j))/i;
count=count+1;
%===========================����payoff===================================
i=n+1;
j=n+1;
height=i*(i-1)/2;
%---------------------------ȡ��Ĭĩ�ڽڵ��·
temp=avgVinEachPath(height+1:
height+j,:
);
%---------------------------��max(avg-E,0)
temp=temp-E;
temp(find(temp<
0))=0;
%---------------------------���Ͻڵ���Ӧ���ǵ�����
temp(i,:
)=temp(i,:
)*q^(n+1-i)*p^(i-1);
%---------------------------��Ͳ�����exp(-������*����)
Asianoption=sum(sum(temp))*exp(-r*n);