IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v22y2025i2d10.1007_s10287-025-00537-2.html
   My bibliography  Save this article

Competitive product ranking algorithms and digital market laws

Author

Listed:
  • Dipankar Das

    (Goa Institute of Management)

Abstract

The ranking algorithm used by digital platforms plays a critical role in shaping competition among vendors, and recent concerns about collusive practices in product listings have prompted regulatory responses worldwide. Upcoming digital market laws will impose strict regulations to maintain fair competition. This article covers the upcoming Digital Market Act in India and the European Union. The current article presents an algorithm that aims to uphold fair competition as mandated by various countries’ "Digital Market Laws" and to optimize the platform’s revenue. The proposed algorithm employs a Bayesian approach to information updating and two-stage assortment optimization techniques to create a fair and competitive digital marketplace. The product ranking or assortment planning model is designed to maximize expected revenue without bias. The study finds that collusive or unfair ranking practices may increase the likelihood of purchasing a product but fail to maximize expected revenue in some cases. In contrast, the proposed assortment planning method maintains competitiveness while maximizing expected revenue. If the platform uses this algorithm, then that will maintain the new digital market laws, amplifying reliability, resulting in more customers visiting the website/platform. The cost of acquiring new sellers in the marketplace will be reduced. Academic research will have some questions to start a new research horizon in the presence of digital market laws, so managerial decisions can be made accordingly.

Suggested Citation

  • Dipankar Das, 2025. "Competitive product ranking algorithms and digital market laws," Computational Management Science, Springer, vol. 22(2), pages 1-28, December.
    • Handle: RePEc:spr:comgts:v:22:y:2025:i:2:d:10.1007_s10287-025-00537-2
    DOI: 10.1007/s10287-025-00537-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-025-00537-2
    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/s10287-025-00537-2?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:comgts:v:22:y:2025:i:2:d:10.1007_s10287-025-00537-2. 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.