arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2005.10038cs.GTecon.TH
收藏

与亚马逊的竞争

Coopetition Against an Amazon

Ronen Gradwohl, Moshe Tennenholtz

摘要:

本文研究了竞争对手之间的合作数据共享,以预测消费者的口味。我们设计了最佳的数据共享方案,既适用于它们只相互竞争的情况,也适用于它们与亚马逊竞争的情况--亚马逊是一家拥有更多、更好数据的公司。我们表明,简单的计划-阈值规则,概率诱导竞争对手之间的充分数据共享,或从一个竞争对手到另一个竞争对手的全部数据传输-是最优的或近似最优的,这取决于信息结构的属性。我们还提供了条件下,企业共享更多的数据,当他们面临更强的外部竞争,并描述了情况下,这一结论是相反的。

英文摘要:

This paper studies cooperative data-sharing between competitors vying to predict a consumer's tastes. We design optimal data-sharing schemes both for when they compete only with each other, and for when they additionally compete with an Amazon -- a company with more, better data. We show that simple schemes -- threshold rules that probabilistically induce either full data-sharing between competitors, or the full transfer of data from one competitor to another -- are either optimal or approximately optimal, depending on properties of the information structure. We also provide conditions under which firms share more data when they face stronger outside competition, and describe situations in which this conclusion is reversed.

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

↑