Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion

Simple item page
dc.creatorIstrate, Gabriel
dc.creatorMarathe, Madhav V.
dc.creatorRavi, S. S.
dc.date2008-03-17
dc.date.accessioned2026-07-07T10:15:05Z
dc.date.available2026-07-07T10:15:05Z
dc.descriptionIn (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.
dc.identifierhttps://arxiv.org/abs/0803.2495
dc.identifierhttp://arxiv.org/abs/0803.2495
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173070
dc.subjectComputer Science and Game Theory
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.subjectProbability
dc.titleAdversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion
dc.typetext

Files

Collections

arXiv