Skip to main content
Article thumbnail
Location of Repository

Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion

By Gabriel Istrate, Madhav V. Marathe and S. S. Ravi

Abstract

Abstract. 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

Topics: evolutionary games, adversarial scheduling, discrete Markov chains
OAI identifier: oai:CiteSeerX.psu:10.1.1.313.8128
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0803.2495... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.