IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v23y2021i5p1139-1156.html
   My bibliography  Save this article

Invite Your Friend and You’ll Move Up in Line: Optimal Design of Referral Priority Programs

Author

Listed:
  • Luyi Yang

    (Haas School of Business, University of California, Berkeley, Berkeley, California 94720)

Abstract

Problem definition : This paper studies the optimal design of referral priority programs, in which customers on a waiting list can jump the line by inviting their friends to also join the waiting list. Academic/practical relevance : Recent years have witnessed a growing presence of referral priority programs as a novel customer-acquisition strategy for firms that maintain a waiting list. Different variations of this scheme are seen in practice, raising the question of what should be the optimal referral priority mechanism. Methodology : I build an analytical model that integrates queuing theory into a mechanism design framework in which the objective of the firm is to maximize the system throughput, that is, accelerate customer acquisition as much as possible. Results : My analysis shows that the optimal mechanism has one of the following structures: full priority; partial priority; first in, first out (FIFO); and strategic delay. A full-priority (partial-priority) scheme enables referring customers to get ahead of all (only some) nonreferring ones. A FIFO scheme does not provide any priority-based referral incentive. A strategic-delay scheme grants full priority to referring customers but artificially inflates the delay of nonreferring ones. I show that FIFO is optimal if either the base-market size or the referral cost is large. Otherwise, partial priority is optimal if the base-market size is above a certain threshold; full priority is optimal at the threshold base-market size; strategic delay is optimal if the base-market size is below the threshold. I also find that referrals motivate the firm to maintain a larger capacity and therefore can surprisingly shorten the average delay, even though more customers sign up and strategic delay is sometimes inserted. Managerial implications : My paper provides prescriptive guidance for launching an optimal referral priority program and rationalizes common referral schemes seen in practice.

Suggested Citation

  • Luyi Yang, 2021. "Invite Your Friend and You’ll Move Up in Line: Optimal Design of Referral Priority Programs," Manufacturing & Service Operations Management, INFORMS, vol. 23(5), pages 1139-1156, September.
  • Handle: RePEc:inm:ormsom:v:23:y:2021:i:5:p:1139-1156
    DOI: 10.1287/msom.2020.0868
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2020.0868
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2020.0868?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormsom:v:23:y:2021:i:5:p:1139-1156. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.