Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion

Authors:
Gabriel Istrate;Madhav V. Marathe;S. S. Ravi
Affiliations:
e-Austria Institute, Timişoara, Romania RO-300223;Network Dynamics and Simulation Science Laboratory, and Dept. of Computer Science Virginia Tech.,;Computer Science Dept., S.U.N.Y. at Albany, Albany, U.S.A. NY 12222
Venue:
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Year:
2008

Citing 8
Cited 0

Multiple cover time

Random Structures & Algorithms
Growing artificial societies: social science from the bottom up

Growing artificial societies: social science from the bottom up
Adversarial models in evolutionary game dynamics

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Toward a Containment Strategy for Smallpox Bioterror: An Individual-Based Computational Approach

Toward a Containment Strategy for Smallpox Bioterror: An Individual-Based Computational Approach
Simulation for the Social Scientist

Simulation for the Social Scientist
Complexity of reachability problems for finite discrete dynamical systems

Journal of Computer and System Sciences
Generative Social Science: Studies in Agent-Based Computational Modeling (Princeton Studies in Complexity)

Generative Social Science: Studies in Agent-Based Computational Modeling (Princeton Studies in Complexity)
Computational aspects of analyzing social network dynamics

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

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 contagioninto Peyton Young's model.