Logo
Munich Personal RePEc Archive

Adversarial scheduling analysis of Game-Theoretic Models of Norm Diffusion.

Istrate, Gabriel and Marathe, Madhav V. and Ravi, S.S. (2008): Adversarial scheduling analysis of Game-Theoretic Models of Norm Diffusion. Forthcoming in: Proceedings of the Fourth Computability in Europe (CIE'2008) Conference No. Lecture Notes in Computer Science vol. 5028 (to appear) (2008): pp. 1-15.

[thumbnail of MPRA_paper_8170.pdf]
Preview
PDF
MPRA_paper_8170.pdf

Download (192kB) | Preview

Abstract

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.

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.