Abstract

We consider the use and value of social-network information in selectively selling goods and services whose value derives from exclusive ownership among network connections or friends. Our model accommodates customers who are heterogeneous in their number of friends (degree) and their proclivity for social comparisons (conspicuity). Firms with information on either (or both) of these characteristics can use it to make the product selectively available and to personalize prices. We find that firms’ preferred customers are low degree and high conspicuity, with the conspicuity threshold nondecreasing in degree. Interestingly, although both degree and conspicuity levels are relevant to curating the desired customer base, we find that firms do not need conspicuity information to do so; its absence can be substituted by incentivizing customers to self-select. There is no such recourse for the absence of degree information. As a result, degree information is typically more valuable than conspicuity information. Our analysis suggests that there are two canonical categories of social information—less valuable “consonant” information on characteristics where firm and customer preferences are aligned and more valuable “competing” information where preferences are misaligned. Customers can be incentivized to act in a way that their actions are a perfect substitute for consonant information, making it less valuable. This paper was accepted by Gad Allon, operations management.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.