Convergence in the finite Cournot oligopoly with social and individual learning
AbstractConvergence to the Nash equilibrium in a Cournot oligopoly is a question that recurrently arises as a subject of controversy in economics. The development of evolutionary game theory has provided an equilibrium concept more directly connected with adjustment dynamics, and the evolutionary stability of the equilibria of the Cournot game have been extensively studied in the literature. Several articles show that the Walrasian equilibrium is the stable ESS of the Cournot game. But no general result has been established for the difficult case of simultaneous heterogenous mutations. Authors propose specific selection dynamics to analyze this case. Vriend (2000) proposes using a genetic algorithm for studying learning dynamics in this game and obtains convergence to Cournot equilibrium with individual learning. The resulting convergence has been questioned by Arifovic and Maschek (2006). The aim of this article is to clarify this controversy. It analyzes the mechanisms that are behind these contradictory results and underlines the specific role of the spite effect. We show why social learning gives rise to the Walrasian equilibrium and why, in a general setup, individual learning can effectively yield convergence to the Cournot equilibrium. We also illustrate these general results by systematic computational experiments.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Journal of Economic Behavior & Organization.
Volume (Year): 72 (2009)
Issue (Month): 2 (November)
Contact details of provider:
Web page: http://www.elsevier.com/locate/jebo
Other versions of this item:
- Thomas Vallée & Murat Yildizoglu, 2009. "Convergence in the Finite Cournot Oligopoly with Social and Individual Learning," Working Papers halshs-00368274, HAL.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Vallee, Thomas & Basar, Tamer, 1999. "Off-Line Computation of Stackelberg Solutions with the Genetic Algorithm," Computational Economics, Society for Computational Economics, vol. 13(3), pages 201-09, June.
- Schaffer, Mark E., 1989. "Are profit-maximisers the best survivors? : A Darwinian model of economic natural selection," Journal of Economic Behavior & Organization, Elsevier, vol. 12(1), pages 29-45, August.
- Fernando Vega Redondo, 1996.
"The evolution of walrasian behavior,"
Working Papers. Serie AD
1996-05, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- James Bergin & Dan Bernhardt, 2004. "Comparative Learning Dynamics," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 45(2), pages 431-465, 05.
- Stegeman, Mark & Rhode, Paul, 2004. "Stochastic Darwinian equilibria in small and large populations," Games and Economic Behavior, Elsevier, vol. 49(1), pages 171-214, October.
- Vriend, Nicolaas J., 2000. "An illustration of the essential difference between individual and social learning, and its consequences for computational analyses," Journal of Economic Dynamics and Control, Elsevier, vol. 24(1), pages 1-19, January.
- Arifovic, Jasmina, 1994. "Genetic algorithm learning and the cobweb model," Journal of Economic Dynamics and Control, Elsevier, vol. 18(1), pages 3-28, January.
- Carlos Alós-Ferrer & Ana Ania, 2005. "The evolutionary stability of perfectly competitive behavior," Economic Theory, Springer, vol. 26(3), pages 497-516, October.
- Thomas Riechmann, 2006. "Cournot or Walras? Long-Run Results in Oligopoly Games," Journal of Institutional and Theoretical Economics (JITE), Mohr Siebeck, Tübingen, vol. 162(4), pages 702-720, December.
- Murat Yildizoglu & Marc-Alexandre Sénégas & Isabelle Salle & Martin Zumpe, 2011.
"Learning the optimal buffer-stock consumption rule of Carroll,"
- Murat YILDIZOGLU (GREQAM, CNRS, UMR 6579) & Marc-Alexandre SENEGAS (GREThA, CNRS, UMR 5113) & Isabelle SALLE (GREThA, CNRS, UMR 5113) & Martin ZUMPE (GREThA, CNRS, UMR 5113), 2011. "Learning the optimal buffer-stock consumption rule of Carroll," Cahiers du GREThA 2011-11, Groupe de Recherche en Economie Théorique et Appliquée.
- Isabelle SALLE (GREThA, CNRS, UMR 5113) & Martin ZUMPE (GREThA, CNRS, UMR 5113) & Murat YILDIZOGLU (GREThA, CNRS, UMR 5113) & Marc-Alexandre SENEGAS (GREThA, CNRS, UMR 5113), 2012. "Modelling Social Learning in an Agent-Based New Keynesian Macroeconomic Model," Cahiers du GREThA 2012-20, Groupe de Recherche en Economie Théorique et Appliquée.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.