Computability in Europe 2008
Logic and Theory of Algorithms
|Author(s):||Gabriel Istrate, Madhav Marathe and S. S. Ravi|
|Slot:||Mon, 11:20-11:40, Great Hall (col. 5)|
In previous work (SODA 2001 short paper) 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.
|websites: Arnold Beckmann||2008-05-18|