Waiting times and equilibrium selection
This paper shows how graphs can be used to calculate waiting times in models of equilibrium selection. It also shows how reducing the state space can simplify the calculations of both waiting times and selected equilibria. The results are applied to potential games and games with strategic complementarities. Copyright Springer-Verlag Berlin/Heidelberg 2005
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): 25 (2005)
Issue (Month): 3 (04)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm |
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:25:y:2005:i:3:p:599-628. 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.