IDEAS home Printed from https://ideas.repec.org/a/spr/elcore/v24y2024i4d10.1007_s10660-022-09643-8.html
   My bibliography  Save this article

More buyers or more sellers: on marketing resource allocation strategies of competing two-sided platforms

Author

Listed:
  • Amit Kumar Bardhan

    (University of Delhi)

  • Saad Ashraf

    (University of Delhi)

Abstract

Two-sided platforms enable and supplement transactions between buyers and sellers. We consider a decision problem facing two such platform firms competing in a market. Each firm needs to divide its budget of a planning period between promotion towards attracting new sellers and new buyers. We propose a generalized Nash equilibrium problem (GNEP) model to find optimal allocations. The GNEP approach provides an eloquent framework for analysis and theory development. An intuitive result from the interpretation of optimality conditions is that a firm’s focus should be higher towards the group whose presence is less on the platform. This focus can shift depending on competitors’ ability to dissuade new customers. Interestingly, the model recommends that a firm should focus on getting new sellers when its customer-focused promotion adversely impacts competitors’ customer acquisition. Predatory promotion strategy adversely affects both. More useful implications can be drawn from the equilibrium analysis. We have assumed that a limited number of sellers are available in the market, whereas no restrictions are imposed on new customer acquisitions. This situation is typical during the entry phase of a two-sided platform.

Suggested Citation

  • Amit Kumar Bardhan & Saad Ashraf, 2024. "More buyers or more sellers: on marketing resource allocation strategies of competing two-sided platforms," Electronic Commerce Research, Springer, vol. 24(4), pages 2579-2608, December.
  • Handle: RePEc:spr:elcore:v:24:y:2024:i:4:d:10.1007_s10660-022-09643-8
    DOI: 10.1007/s10660-022-09643-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10660-022-09643-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10660-022-09643-8?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.

    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:spr:elcore:v:24:y:2024:i:4:d:10.1007_s10660-022-09643-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.