您当前所在位置: 首页 > 学者
在线提示

恭喜!关注成功

在线提示

确认取消关注该学者?

邀请同行关闭

只需输入对方姓名和电子邮箱,就可以邀请你的同行加入中国科技论文在线。

真实姓名:

电子邮件:

尊敬的

我诚挚的邀请你加入中国科技论文在线,点击

链接,进入网站进行注册。

添加个性化留言

已为您找到该学者19条结果 成果回收站

上传时间

2005年07月07日

【期刊论文】CRRA、LA、LA和DA三种效用模型的比较分析

李仲飞, 梅琳

管理评论,2004,16(11):10~15,-0001,():

-1年11月30日

摘要

从经典的CRRA效用模型到近期关于LA和DA效用的研究,金融理论在新古典范式的基础上辅助了对行为和心理的分析。本文认为尤其值得指出的是,行为和心理研究带给金融学的新视角不仅从概念上对资产分配决策问题进行了革新,而且还逐渐将人们的行为特征模型化、数学化,这就大大推进了投资者在面临复杂的不确定性时的投资决策问题的研究。本文希望通过对CRRA、LA、DA三种效用模型的比较分析,对“不确定性”下的投资决策问题的研究提供有益的思路。

上传时间

2005年07月07日

【期刊论文】COMPUTATIONAL COMPLEXITY OF ARBITRAGE IN FRICTIONAL SECURITY MARKET

李仲飞, XIAOTIE DENG*, ZHONG-FEI LI, SHOU-YANG WANG

,-0001,():

-1年11月30日

摘要

We are interested in computation of arbitrage condition in financial market with friction. We consider a deterministic model with a finite number of financial assets and a finite number of possible states of nature. The future return of of each asset under each possible state of nature is given in the model. We derive a negative result on computational complexity of arbitrage in the case when assets are traded in integer numbers of shares and with a maximum amount of shares that can be bought for a fixed price.

Arbitrage, Computational complexity.,

上传时间

2005年07月07日

【期刊论文】Computation of Arbitrage in a Financial Market with Various Types of Frictions

李仲飞, Mao-cheng Cai, Xiaotie Deng, and Zhongfei Li*

AAIM 2005, LNCS 3521, pp. 270-280, 2005.,-0001,():

-1年11月30日

摘要

In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of frictions under consideration include fixed and proportional transaction costs, bid-ask spreads, taxes, and upper bounds on the number of units for transaction. We obtain some negative result on computational diculty in general for arbitrage under those frictions: It is NP-complete to identify whether there exists a cash-and-carry arbitrage transaction and it is NP-hard to find an optimal cash-and-carry arbitrage transaction.

上传时间

2005年07月07日

【期刊论文】A linear programming algorithm for optimal portfolio selection with transaction costs

李仲飞, Zhong-Fei Li, Shou-Yang Wang and Xiao-Tie Deng

International Journal of Systems Science, 2000, volume 31, number 1, pages 107-117,-0001,():

-1年11月30日

摘要

We study the optimal portfolio selection problem with transaction costs. In general, the ecient frontier can be determined by solving a parametric non-quadratic programming problem. In a general setting, the transaction cost is a V-shaped function of dierence between the existing and the new portfolio. We show how to transform this problem into a quadratic programming model. Hence a linear programming algorithm is applicable by establishing a linear approximation on the utility function of return and variance.

合作学者

  • 李仲飞 邀请

    中山大学,广东

    尚未开通主页