IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v71y2023i6p2245-2266.html
   My bibliography  Save this article

Optimal Subscription Planning for Digital Goods

Author

Listed:
  • Saeed Alaei

    (Google Research, Mountain View, California 94043)

  • Ali Makhdoumi

    (Fuqua School of Business, Duke University, Durham, North Carolina 27708)

  • Azarakhsh Malekian

    (Rotman School of Management, University of Toronto, Toronto, Ontario M5S 3E6, Canada)

Abstract

We consider a media service provider that gives users access to digital goods through subscription. In our model, different types of users with heterogeneous usage rates repeatedly use a platform over a period of time. There are multiple item types on the platform, and the value of an item to a user is random and depends on both the user type and the item type. The design of the platform’s subscription planning comprises selecting a subscription fee for each set of item types. Before the beginning of the subscription period, given the subscription planning, users decide which set of item types to subscribe to (if any). During the subscription period, a user pays zero price to use an item if it has subscribed to a set that includes it and pays its rental price otherwise. For an exogenously given rental price, we establish the sufficient and necessary condition for the optimality of grand subscription—offering a single subscription set that includes all items. We then consider a setting in which the platform chooses both the subscription fee for each set of item types and the rental price of each item type and establish that there exist subscription fees proportional to the cardinality of each set of item types (with no rental offers) that achieve a logarithmic approximation (in the number of item types) of the optimal revenue. Finally, we demonstrate that our performance guarantee is tight for a class of problem instances.

Suggested Citation

  • Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian, 2023. "Optimal Subscription Planning for Digital Goods," Operations Research, INFORMS, vol. 71(6), pages 2245-2266, November.
  • Handle: RePEc:inm:oropre:v:71:y:2023:i:6:p:2245-2266
    DOI: 10.1287/opre.2023.2468
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2023.2468
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2023.2468?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:oropre:v:71:y:2023:i:6:p:2245-2266. 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.