|
||||
|
||||
Optimal Sequential Investigation Rules in Competition LawWolfgang KerberPhilipps University Marburg - Department of Business Administration and Economics Jürgen-Peter KretschmerPhilipps University Marburg - Department of Business Administration and Economics Georg Von WangenheimUniversity of Kassel September 2008 Abstract: Although both in US antitrust and European competition law there is a clear evolution to a much broader application of "rule of reason" (instead of per-se rules), there is also an increasing awareness of the problems of a case-by-case approach. The "error costs approach" (minimizing the sum of welfare costs of decision errors and administrative costs) allows not only to decide between these two extremes, but also to design optimally differentiated rules (with an optimal depth of investigation) as intermediate solutions between simple per-se rules and a full-scale rule of reason. In this paper we present a decision-theoretic model that can be used as an instrument for deriving optimal rules for a sequential investigation process in competition law. Such a sequential investigation can be interpreted as a step-by-step sorting process into ever smaller subclasses of cases that help to discriminate better between pro- and anticompetitive cases. We analyze both the problem of optimal stopping of the investigation and optimal sequencing of the assessment criteria in an investigation. To illustrate, we show how a more differentiated rule on resale price maintenance could be derived after the rejection of its per-se prohibition by the US Supreme Court in the "Leegin" case 2007.
Number of Pages in PDF File: 31 Keywords: Law Enforcement, Decision-Making, Competition Law, Antitrust Law JEL Classification: K20, K21, K40, D81 working papers seriesDate posted: September 12, 2008Suggested CitationContact Information
|
|
|||||||||||||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo3 in 0.328 seconds