In [IMR01] 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 [You98]. In particular, our main result incorporates contagion into Peyton Young's model. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Istrate, G., Marathe, M. V., & Ravi, S. S. (2008). Adversarial scheduling analysis of game-theoretic models of norm diffusion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5028 LNCS, pp. 273–282). Springer Verlag. https://doi.org/10.1007/978-3-540-69407-6_31
Mendeley helps you to discover research relevant for your work.