arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2311.01692q-fin.PMq-fin.MF
收藏

利用递增凸序战胜基准

Benchmark Beating with the Increasing Convex Order

Jianming Xia

AI总结:

本文用ICX序刻画战胜基准,将均值约束解释为战胜常数,并在完备市场中闭式求解ICX约束下的最小方差及战胜业绩-方差有效投资组合。

摘要:

本文采用递增凸序(ICX序)对战胜基准进行建模。投资组合选择的均值-方差理论中的均值约束,可被视为战胜一个常数。随后,我们研究在ICX序约束下最小化投资组合方差的问题,并在此基础上探讨战胜业绩-方差有效投资组合问题。对于完备市场,最优投资组合与有效投资组合均以闭式解求出。

英文摘要:

In this paper we model benchmark beating with the increasing convex order (ICX order). The mean constraint in the mean-variance theory of portfolio selection can be regarded as beating a constant. We then investigate the problem of minimizing the variance of a portfolio with ICX order constraints, based on which we also study the problem of beating-performance-variance efficient portfolios. The optimal and efficient portfolios are all worked out in closed form for complete markets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑