IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-00375798.html

Optimal Collusion with Limited Severity Constraint

Author

Listed:
  • Etienne Billette de Villemeur

    (GREMAQ - Groupe de recherche en économie mathématique et quantitative - UT Capitole - Université Toulouse Capitole - Comue de Toulouse - Communauté d'universités et établissements de Toulouse - INRA - Institut National de la Recherche Agronomique - EHESS - École des hautes études en sciences sociales - CNRS - Centre National de la Recherche Scientifique)

  • Laurent Flochel

    (CRA - Charles River Associates International - Charles River Associates International)

  • Bruno Versaevel

    (EM - EMLyon Business School, GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - Université de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique)

Abstract

Collusion sustainability depends on firms' aptitude to impose sufficiently severe punishments in case of deviation from the collusive rule. We characterize the ability of oligopolistic firms to implement a collusive strategy when their ability to punish deviations over one or several periods is limited by a severity constraint. It captures all situations in which either structural conditions (the form of payoff functions), institutional circumstances (a regulation), or financial considerations (profitability requirements) set a lower bound to firms' losses. The model specifications encompass the structural assumptions (A1-A3) in Abreu (1986) [Journal of Economic Theory, 39, 191-225]. The optimal punishment scheme is characterized, and the expression of the lowest discount factor for which collusion can be sustained is computed, that both depend on the status of the severity constraint. This extends received results from the literature to a large class of models that include a severity constraint, and uncovers the role of structural parameters that facilitate collusion by relaxing the constraint.

Suggested Citation

  • Etienne Billette de Villemeur & Laurent Flochel & Bruno Versaevel, 2009. "Optimal Collusion with Limited Severity Constraint," Post-Print halshs-00375798, HAL.
    • Handle: RePEc:hal:journl:halshs-00375798
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00375798v1
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00375798v1/document
    Download Restriction: no
    ---><---

    Other versions of this item:

    More about this item

    Keywords

    ;
    ;
    ;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D43 - Microeconomics - - Market Structure, Pricing, and Design - - - Oligopoly and Other Forms of Market Imperfection
    • L13 - Industrial Organization - - Market Structure, Firm Strategy, and Market Performance - - - Oligopoly and Other Imperfect Markets

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hal:journl:halshs-00375798. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.