Computer Science – Computer Science and Game Theory
Scientific paper
2008-03-17
Computer Science
Computer Science and Game Theory
Scientific paper
In (Istrate, Marathe, Ravi 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 into Peyton Young's model.
Istrate Gabriel
Marathe Madhav V.
Ravi Srivaths
No associations
LandOfFree
Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-646600