IDEAS home Printed from https://ideas.repec.org/a/taf/recjxx/v18y2022i2p406-423.html
   My bibliography  Save this article

Estimating cartel damages using machine learning

Author

Listed:
  • Oliver März

Abstract

This paper presents an alternative to the workhorse linear OLS regression model when predicting “but-for” prices in cartel damage estimation. By replicating the dataset from a prominent Vitamin C antitrust case of price-fixing, I show that a supervized machine learning algorithm achieves more accurate predictions of prices based on cross-validated out-of-sample testing than the OLS model applied by the court expert. The machine learning algorithm is therefore better suited in this case to predict prices for the counterfactual scenario that no cartel existed, and to calculate damages based on those predictions. I find that the machine learning algorithm p redicts damages that are 14% lower than those predicted by the court expert's OLS model. Given that millions of dollars are usually at stake in cartel litigation cases, it is recommended that machine learning algorithms should be in the toolbox of practitioners attempting to derive the most accurate estimate of cartel-related damages.

Suggested Citation

  • Oliver März, 2022. "Estimating cartel damages using machine learning," European Competition Journal, Taylor & Francis Journals, vol. 18(2), pages 406-423, May.
  • Handle: RePEc:taf:recjxx:v:18:y:2022:i:2:p:406-423
    DOI: 10.1080/17441056.2021.2002590
    as

    Download full text from publisher

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

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

    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:recjxx:v:18:y:2022:i:2:p:406-423. 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/recj .

    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.