检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王玮 蓝颖杰 严建援[1] WANG Wei LAN Ying-fie YAN Jian-yuan(School of Business, Nankai University, Tianjin 300071, China Peking University HSBC Business School, Shenzhen 518055, China)
机构地区:[1]南开大学商学院,天津300071 [2]北京大学汇丰商学院,深圳518055
出 处:《管理科学学报》2017年第9期15-24,共10页Journal of Management Sciences in China
基 金:国家自然科学基金资助项目(71471003)
摘 要:针对交易者事先仅知道价格波动范围的占线单向交易问题,基于Savage后悔值准则提出了竞争差分析方法,通过引入一个假想的能够控制价格的"对手"将原来的单人决策问题转化为双人零和博弈问题.与竞争比分析相比,竞争差分析由于目标函数的数学形式更简单,因而可以直接采用逆向归纳法求解获得使最大后悔值(竞争差)最小化的稳健的占线交易策略,并找出对于交易者而言所有可能的最糟糕情况,而不必像竞争比分析那样需要事先猜测最优占线策略的特征;此外,数值模拟结果表明,基于竞争差分析的占线算法更节省计算时间,且在解决收益最大化问题时不像竞争比分析那样过于保守,一般具有更好的期望绩效.How to make online trading decisions in one-way trading when only the range of prices in the future is known beforehand? This paper applies Savage' s mini-max regret criter/on and proposes a method of compet- itive difference analysis (CDA). The CDA introduces an imaginary adversary who controls the price se- quences, thus transforming the original one-person decision-making problem into a two-person zero-sum game. Compared with the widely used method of competitive ratio analysis (C1RA) which deoends heavilv on nrior intuition, the CDA can directly obtain the optimal online os for the trader via backward induction. In addition, trading strategy and all the possible worst-case scenari- numerical experiments show that the online algorithm based on CDA can save calculation time and that it outperforms the online algorithm based on CRA when sol- ving revenue-maximization problems because it is less conservative.
关 键 词:单向交易 占线算法 竞争差分析 竞争比分析 mini-max后悔值准则
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43