In this note we study a very simple trial & error learning process in the context of a Cournot oligopoly. Without any knowledge of the payoff functions players increase, respectively decrease, their quantity by one unit as long as this leads to higher profits. We show that this process converges to a collusive outcome.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Find related papers by JEL classification: C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games L13 - Industrial Organization - - Market Structure, Firm Strategy, and Market Performance - - - Oligopoly and Other Imperfect Markets
This paper has been announced in the following NEP Reports:
Cited by: (explanations, 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.)
Peter Dürsch & Albert Kolb & Jörg Oechssler & Burkhard C. Schipper, 2005.
"Rage Against the Machines: How Subjects Learn to Play Against Computers,"
Discussion Papers
63, SFB/TR 15 Governance and the Efficiency of Economic Systems, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
[Downloadable!]
Other versions: