Communication, complexity, and evolutionary stability
In games with costless preplay communication, some strategies are more complex than others in the sense that they induce a finer partition of the set of states of the world. This paper shows that if the concept of evolutionary stability, which is argued to be a natural solution concept for communication games, is modified to take lexicographic complexity preferences into account, then for a class of games of common interest only communication strategies that induce payoff-dominant Nash outcomes of the underlying game are stable.
If 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.
Volume (Year): 27 (1998)
Issue (Month): 4 ()
|Note:||Received April 1998/Final version September 1998|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00182/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:27:y:1998:i:4:p:599-609. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.