IDEAS home Printed from https://ideas.repec.org/p/net/wpaper/2205.html
   My bibliography  Save this paper

Do Referral Programs Drive Loyalty?

Author

Listed:
  • Xintong Han

    (Concordia University and CIREQ, Department of Economics, 1455 Boulevard de Maisonneuve Ouest, Concordia University, Montreal, H3G 1M8, Canada)

  • Shaojia Wang

    (Concordia University, Department of Economics, 1455 Boulevard de Maisonneuve Ouest, Concordia University, Montreal, H3G 1M8, Canada)

  • Tong Wang

    (University of Edinburgh, Business School, 29 Buccleuch Pl, Edinburgh EH8 9JS. United Kingdom)

Abstract

Using unique data from a leading Chinese content platform with more than 300,000 users, we propose a structural approach to evaluate the effect of the structure of a referral network on users’ renewal decisions. Referral networks provide essential identification sources, which enable us to embed the expectation of network peers’ behavior into the utility function as an important component to capture the decision variations. We find that these networks play an essential role in users’ renewal decisions, which are significantly and positively associated with the renewal decisions of both referrers and referrals. Our counterfactual analysis has important implications for the referral policies of digital platforms. First, we find that the referral-targeted discount discrimination policy is more effective than the uniform discount policy. More optimistic expectations for referrals’ decisions due to the price discount generate a snowball effect on referral networks, which in turn increases renewal rates. Compared to a uniform discount policy, a more referral-targeted discount policy would significantly increase renewal rates while reducing overall revenue loss. Second, our results highlight the importance of the structure of a referral network. With the same beta index, a high-centrality network implies a reduction in the chain hierarchy, which is detrimental to customer retention. We suggest that an efficient referral network should be highly connected with a lower degree of closeness-based centrality.

Suggested Citation

  • Xintong Han & Shaojia Wang & Tong Wang, 2022. "Do Referral Programs Drive Loyalty?," Working Papers 22-05, NET Institute.
  • Handle: RePEc:net:wpaper:2205
    as

    Download full text from publisher

    File URL: http://www.netinst.org/Han_22-05.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    network structural; renewal decision; referral programs; structural estimation;
    All these keywords.

    JEL classification:

    • C51 - Mathematical and Quantitative Methods - - Econometric Modeling - - - Model Construction and Estimation
    • L53 - Industrial Organization - - Regulation and Industrial Policy - - - Enterprise Policy
    • L82 - Industrial Organization - - Industry Studies: Services - - - Entertainment; Media

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:net:wpaper:2205. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Nicholas Economides (email available below). General contact details of provider: http://www.NETinst.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.