期刊文献+

有限交易机会下占线单向交易问题的竞争差分析 被引量:1

Online one-way trading problem with limited opportunities based on competitive difference analysis
原文传递
导出
摘要 该研究针对仅知道价格波动范围的有限交易机会的单向交易问题,采用竞争差分析方法构建数学模型,求解得到了最优的稳健性占线交易策略,并分析了该策略的性质,确定了该策略相对于最优离线交易策略所能达到的绩效保障(即最小竞争差).此外,研究还指出了对于交易者而言所有可能的最糟糕价格情况.该研究不仅可以用于指导现实中的单向交易行为,特别是交易者需要通过限制交易次数来控制交易成本的情形,同时,它还提供了统一的模型框架将文献中关注的时间序列搜索问题和无次数限制的单向交易问题联系了起来,便于对各类问题进行比较,丰富和完善了已有的研究结论,还为进一步分析更复杂的单向交易问题打下了基础. This paper examines the one-way trading problem with limited trading opportunities and limited information about future prices(i.e.,price range),and constructs the mathematical model via the method of competitive difference analysis.It obtains the optimal robust online trading policy,analyzes the properties of this online policy,and determines the performance guarantee of this online policy relative to the optimal offline policy,i.e.,the minimal competitive difference.In addition,this paper points out all the possible worst-case scenarios for the trader.This research can not only guide the one-way trading behavior in reality when the trader needs to control transaction costs by limiting transactions,but also provide a uniform mathematical framework that connects the well-studied time series search problem and the one-way trading problem with unlimited opportunities.This unified framework facilitates the comparison between these different types of problems,enriches the conclusions of existing literatures,and lays the foundation for future researches on more complicated one-way trading problems.
作者 王玮 蓝颖杰 WANG Wei;LAN Yingjie(Business School,Nankai University,Tianjin 300071,China;HSBC Business School,Peking University,Shenzhen 518055,China)
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2021年第10期2476-2487,共12页 Systems Engineering-Theory & Practice
基金 国家自然科学基金(71471003,71702082)。
关键词 单向交易问题 有限交易机会 有限信息 Savage后悔值准则 博弈论 one-way trading problems limited trading opportunities limited information Savage’s regret criterion game theory
  • 相关文献

参考文献3

二级参考文献19

  • 1董玉成,徐寅峰,徐维军.可退货在线租赁竞争分析及其风险回报模型[J].中国管理科学,2007,15(4):28-33. 被引量:14
  • 2Karp R. On-line algorithms versus off-line algorithms: How much is it worth to know the future[C]//Proceedings of the IFIP 12th World Computer Congress, 1992, 1: 416- 429.
  • 3Epstein L, Zebedat-Haider H. Rent or buy problems with a fixed time horizon[J]. Theory of Computing Systems, 2015, 56(2): 309-329.
  • 4A1-Binali S. A risk-reward framework for the competitive analysis of financial games[J]. Algorithmica, 1999, 25: 99- 115.
  • 5Zhang Y, Zhang W G, Xu W J, et al. Risk-reward models for on-line leasing of depreciable equipment[J]. Computers and Mathematics with Applications, 2012, 63(2012): 167-174.
  • 6Fujiwara H, Kitano T, Fujito T. On the best possible competitive ratio for multislope ski rental[J]. Journal of Combinatorial Optimization, 2016, 31(2): 463-490.
  • 7Fujiwara H, Konno Y, Fujito T. Lower bounds for the multislope ski-rental problem[C]// Proceedings of the llth International Symposium on Operations Research and Its Applications in Engineering, Technology and Management, 2013: 24-29.
  • 8Lotker Z, Patt-Shamir B, Rawitz D. Ski rental with two general options[J]. Information Processing Letters, 2008, 108:365 -368.
  • 9Lotker Z, Patt-Shamir B, Rawitz D. Rent, lease, or buy: Randomized algorithms for multislope ski rental[J]. SIAM Journal on Discrete Mathematics, 2012, 26(2): 718-736.
  • 10Yang X Y, Zhang W G, Xu W J, et al. Competitive analysis for online leasing problem with compound interest rate[J]. Abstract & Applied Analysis, 2011, 26(1): 243-252.

共引文献9

同被引文献19

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部