期刊文献+

伯川德竞争下供应链信息泄露问题的研究 被引量:2

Study of information leakage in a supply chain under Bertrand competition
下载PDF
导出
摘要 文章探讨了供应链成员面对信息泄露时所做出的决策,考虑包含1个供应商和2个进行价格竞争的零售商的供应链,其中一个零售商为主导零售商,拥有市场需求的私有信息,另一个零售商追随主导零售商的决策,为跟随零售商。零售商与供应商进行信息共享和合作定价,而供应商则可能将主导零售商的定价信息泄露给跟随零售商。通过建立相关的信号博弈模型,分析了存在信息泄露问题的情况下,供应链成员的决策并得出零售商的分离均衡定价。出乎意料的是,相互竞争的零售商在信息泄露的情形下,能获得更大的利润。 This paper explores the decisions of the members facing the effect of information leakage in a supply chain including one supplier and two Bertrand retailers. The retailers share information and make cooperative pricing with the supplier. One retailer has private information about uncertain market potential, as the incumbent. The other retailer follows the incumbent' s decisions, as entrant. The price information of the incumbent may be leaked to the entrant Joy the supplier. By applying game theory and constructing signaling game,model, the members' decisions are analyzed and the separating equilibrium price of retailers under the information leakage is given. Surprisingly, under the information leakage, the competitive retailers benefit more than non-leakage.
出处 《合肥工业大学学报(自然科学版)》 CAS CSCD 北大核心 2015年第8期1137-1142,共6页 Journal of Hefei University of Technology:Natural Science
基金 全国统计科学研究计划重点资助项目(2013387)
关键词 信息不对称 信息泄露 博弈论 伯川德竞争 information asyrmnetry information leakage game theory Bertrand competition
  • 相关文献

参考文献12

  • 1Kong G, Rajagopalan S, Zhang H. Revenue sharing and information leakage in a supply chain[J]. Management Sci- ence, 2013, 59(3): 556-572.
  • 2Hays C L. What Wal-Mart knows about customers' habits [N]. The New York Times, 2004-11-14.
  • 3Anand K S, Goyal M. Strategic information management under leakage in a supply chain[J]. Management Science, 2009, 55(3): 438-452.
  • 4Lee H L, Whang S. Information sharing in a supply chain [J]. International Journal of Manufacturing Technology and Management, 2000, 1(1): 79-93.
  • 5Chen F. Information sharing and supply chain coordination [J]. Handbooks in Operations Research and Management Science, 2003, 11: 341-421.
  • 6Ozer O, Wei W. Strategic commitments for an optimal ca- pacity decision under asymmetric forecast information[J]. Management Science, 2006, 52(8) : 1238-1257.
  • 7经怀明,刘林,刘心报.两阶段供应链中库存信息共享的价值测算及模拟分析[J].合肥工业大学学报(自然科学版),2005,28(8):854-858. 被引量:3
  • 8Li L. Information sharing in a supply chain with horizontal competition [J]. Management Science, 2002, 48 ( 9 ) : 1196-1212.
  • 9Zhang H. Vertical information exchange in a supply chain with duopoly retailers[J]. Production and Operations Man- agement, 2002, 11(4): 531-546.
  • 10Li L, Zhang H. Confidentiality and information sharing in supply chain coordination [J]. Management Science, 2008, 54(8): 1467-1481.

二级参考文献24

  • 1王夏阳.契约激励、信息共享与供应链的动态协调[J].管理世界,2005,21(4):106-115. 被引量:43
  • 2申悦,于瑞峰,吴甦,刘丽文.零售商B ertrand竞争下的供应链成本信息共享价值[J].清华大学学报(自然科学版),2005,45(11):1581-1584. 被引量:47
  • 3Lee H L, So K C, Tang C S. The value of information sharing in a two-level supply chain[ J]. Management Science. 2000, 46(5) : 626-643.
  • 4Gaur V, Giloni A, Seshadri S. Information sharing in a supply chain under ARMA demand[J]. Management Science. 2005, 51 (6) : 961-969.
  • 5Hays C L. What wal-mart knows about customers' habits[ N]. The NewYork Times, Nov. 14, 2004.
  • 6Murphy T. Protection In Question[ EB/OL]. http ://wardsautoworld. com/ar/auto - protection - question/, 2007-08-01.
  • 7Zhang C, Li S. Secure information sharing in internet-based supply chain management systems[ J]. Journal of Computer Information Systems. 2006, 46(4) : 18-24.
  • 8Li L. Information sharing in a supply chain with horizontal competition[ J]. Management Science. 2002, 48 (9) : 1196-1212.
  • 9Zhang H. Vertical information exchange in a supply chain with duopoly retailers[ J]. Production and Operations Management. 2002, 11(4) : 531-546.
  • 10Yue X, Liu J. Demand forecast sharing in a dual-channel supply chain [ J ]. European Journal of Operational Research. 2006, 174( 1 ) : 646-667.

共引文献12

同被引文献41

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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