IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v63y2024i1d10.1007_s10614-022-10326-7.html
   My bibliography  Save this article

Detecting Collusive Shill Bidding in Commercial Online Auctions

Author

Listed:
  • L. A. Gerritse

    (De Nederlandsche Bank)

  • C. F. A. Wesenbeeck

    (Vrije Universiteit Amsterdam)

Abstract

Online auctions are increasingly used as a smart and efficient way to optimise the consumers’ and sellers’ utility. A recently active field of research is the detection of fraud in online auctions. One of the most difficult types of fraud to detect is collusive shill bidding, where multiple user accounts jointly drive up the bids in an auction. This paper revises the Collusive Shill Bidding Algorithm(CSBD) proposed by Majadi et al. (2019) to develop an algorithm that is applied to a data set from an online auction platform (TBAuctions). We find that our algorithm converges, that computation time can be significantly reduced by appropriate choice of parameters, and we identify Shill Bidding for this data set, although the accuracy of the algorithm cannot be tested because of lack of ground truth values for the data. The paper further discusses steps needed for application of the algorithm to (very) large data sets, using a multiple core server, which despite substantial reduction in computation time would still require too much time to foresee a rapid implementation in real-time.

Suggested Citation

  • L. A. Gerritse & C. F. A. Wesenbeeck, 2024. "Detecting Collusive Shill Bidding in Commercial Online Auctions," Computational Economics, Springer;Society for Computational Economics, vol. 63(1), pages 1-20, January.
    • Handle: RePEc:kap:compec:v:63:y:2024:i:1:d:10.1007_s10614-022-10326-7
    DOI: 10.1007/s10614-022-10326-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-022-10326-7
    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/s10614-022-10326-7?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:kap:compec:v:63:y:2024:i:1:d:10.1007_s10614-022-10326-7. 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.