Advanced Search
MyIDEAS: Login

Duopoly strategies programmed by experienced players

Contents:

Author Info

  • Selten,Reinhard
  • Mitzkewitz,Michael
  • Uhlich,Gerald

    (University of Bonn)

Abstract

This paper reports a strategy study on a twenty-period supergame of a numerically specified asymmetric Cournot duopoly. The subjects were twenty-three participants of a student seminar. Three rounds of game playing were followed by three rounds of strategy programming with computer tournaments. The final strategies show a typical approach to the strategic problem: subjects first select an 'ideal point,' a cooperative goal based on fairness criteria, and then design a 'measure for measure policy' that reciprocates movements to the ideal point or away from it; no quantitative expectations are formed and nothing is optimized. Typicalness is positively correlated with success.

(This abstract was borrowed from another version of this item.)

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Bibliographic Info

Paper provided by University of Bonn, Germany in its series Discussion Paper Serie B with number 106.

as in new window
Length:
Date of creation:
Date of revision:
Handle: RePEc:bon:bonsfb:106

Contact details of provider:
Postal: Bonn Graduate School of Economics, University of Bonn, Adenauerallee 24 - 26, 53113 Bonn, Germany
Fax: +49 228 73 6884
Web page: http://www.bgse.uni-bonn.de/index.php?id=517

Related research

Keywords: Game theory; Duopoly supergame; Asymmetric Cournot duopoly;

Other versions of this item:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:bon:bonsfb:106

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (BGSE Office).

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.