Coopetition Against an Amazon

Ronen Gradwohl and Moshe Tennenholtz

Abstract: 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.

Date: 2020-05, Revised 2021-11
New Economics Papers: this item is included in nep-com, nep-gth and nep-ind
References: Add references at CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2005.10038 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2005.10038

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().