The authors demonstrate the uses of agent-based computational models in an application to a social enigma they call the “emperor’s dilemma,” based on the Hans Christian Andersen fable. In this model, agents must decide whether to comply with and enforce a norm that is supported by a few fanatics and opposed by the vast majority. They find that cascades of self-reinforcing support for a highly unpopular norm cannot occur in a fully connected social network. However, if agents’ horizons are limited to immediate neighbors, highly unpopular norms can emerge locally and then spread. One might expect these cascades to be more likely as the number of “true believers” increases, and bridge ties are created between otherwise distant actors. Surprisingly, the authors observed quite the opposite effects.
- 2006 Award for Best Publication in Mathematical Sociology, American Sociological Association