Abstract
In this paper, we revisit the size of stable cartels in a symmetric oligopoly model with a Cournot fringe. Konishi and Lin (1999) make a conjecture on the size of stable cartels. Due to algebra complexity, they test the conjecture by conducting numerical simulations. We provide an analytical approach to determine the size of stable cartels, and show that the size of stable cartels is slightly larger than the one in their conjecture. Furthermore, we find that the uniqueness of the stable cartel in Konishi and Lin (1999) could not always hold.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
