Adversarial scheduling analysis of Game-Theoretic Models of Norm Diffusion
In (Istrate et al. SODA 2001) we advocated the investigation of robustness of results in the theory of learning in games under adversarial scheduling models. We provide evidence that such an analysis is feasible and can lead to nontrivial results by investigating, in an adversarial scheduling setting, Peyton Young's model of diffusion of norms . In particular, our main result incorporates contagion into Peyton Young's model.
|Date of creation:||09 Apr 2008|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC
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.:
- Joshua M. Epstein & Robert L. Axtell, 1996. "Growing Artificial Societies: Social Science from the Bottom Up," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262550253, June.
- Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
- H Peyton Young, 2000. "The Diffusion of Innovations in Social Networks," Economics Working Paper Archive 437, The Johns Hopkins University,Department of Economics.
- John C. Harsanyi & Reinhard Selten, 1988. "A General Theory of Equilibrium Selection in Games," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262582384, June.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:8170. 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: (Ekkehart Schlicht)
If references are entirely missing, you can add them using this form.