This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Emergence Of Coordination In Evolutionary Games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Claudia Lawrenz (University of Osnabrueck)
Abstract

This paper presents a computational model of learning which is intended to capture some basic observations of recent studies of game experiments. Furthermore it should give a satisfactory explanation for the coordinating behavior in the context of evolutionary games.In a repeated simple coordination game boundedly rational heterogeneous agents face anonymous opponents. Every player chooses one out of his collection of behavioral rules. According to this rule he assesses probabilities to the opponent's strategies and takes a mixed strategy. If the realized payoff exceeds the player's aspiration level, the average payoff, the behavioral rule is reinforced, otherwise weakened in favor of his other rules. The agents update their collections of behavioral rules via some kind of genetic algorithm.The model combines elements from replicator dynamics and fictitious play; the weighting scheme for the agents' rules follows suggestions from studies of exponential fictitious play. The game environment is chosen following the experimental settings of Van Huyck, Battalio and Rankin (1997) who investigate the role of matching protocols and labels in a coordination game experiment. Against this experimental data our model is tested. Depending on the matching protocol and the label treatment distinct levels of coordination emerge, but even within the same settings quite different courses of the experimental sessions can be observed. Our model is able to capture the qualitative properties of the experimental behavior, especially it can explain the courses in terms of varying the size of agents' memory and the experimentation rate.

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 file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://fmwww.bc.edu/cef00/papers/paper322.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 2000 with number 322.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: 05 Jul 2000
Date of revision:
Handle: RePEc:sce:scecf0:322

Contact details of provider:
Postal: CEF 2000, Departament d'Economia i Empresa, Universitat Pompeu Fabra, Ramon Trias Fargas, 25,27, 08005, Barcelona, Spain
Fax: +34 93 542 17 46
Email:
Web page: http://enginy.upf.es/SCE/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).

Related research
Keywords:

Statistics
Access and download statistics

Did you know? IDEAS was launched in September 1997.

This page was last updated on 2008-12-2.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.