IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v56y2018i5p1918-1933.html
   My bibliography  Save this article

Optimal price and maximum deal size on group-buying websites for sellers with finite capacity

Author

Listed:
  • Shiming Deng
  • Xuan Jiang
  • Yanhai Li

Abstract

This paper presents an analytical model for sellers with finite capacity to optimise their price and maximum deal size limit on group-buying websites. For the general demand functions that satisfy some mild regularity conditions, the optimal strategies and the corresponding deal parameters are characterised. The optimal strategies demonstrate that deep online discounts (selling products below the cost or even selling products for free) can be optimal if the maximum deal size is used strategically. Moreover, deep discounts can be beneficial even if the capacity is tight, which explains the use of deep discounts commonly observed in practice. Our results also provide the operators of group-buying websites with useful suggestions on how to induce sellers to offer deep discounts. Sensitivity analysis with regard to the minimum deal size and capacity is provided. Our analysis shows that counter-intuitively selling out capacity may not always be optimal, even if the amount of capacity cannot satisfy the unconstrained optimal sales quantity online. Finally, we extend the model to consider offline prices being sellers’ decisions and discuss the robustness of the optimal strategies when the demand is stochastic.

Suggested Citation

  • Shiming Deng & Xuan Jiang & Yanhai Li, 2018. "Optimal price and maximum deal size on group-buying websites for sellers with finite capacity," International Journal of Production Research, Taylor & Francis Journals, vol. 56(5), pages 1918-1933, March.
  • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:5:p:1918-1933
    DOI: 10.1080/00207543.2017.1282643
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1282643
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2017.1282643?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shen-Tsu Wang & Meng-Hua Li & Chun-Chi Lien, 2019. "Optimal Multiple Attribute Decision Model for Key Parameters of Online Group Buying Product," Mathematics, MDPI, vol. 7(10), pages 1-21, September.

    More about this item

    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:taf:tprsxx:v:56:y:2018:i:5:p:1918-1933. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.