Abstract

The occurrence of discrimination is an important problem in the social and economical sciences. Much of the discrimination observed in empirical studies can be explained by the theory of in-group favouritism, which states that people tend to act more positively towards peers whose appearances are more similar to their own. Some studies, however, find hierarchical structures in inter-group relations, where members of low-status groups also favour the high-status group members. These observations cannot be understood in the light of in-group favouritism. Here we present an agent based model in which evolutionary dynamics can result in a hierarchical discrimination between two groups characterized by a meaningless, but observable binary label. We find that discriminating strategies end up dominating the system when the selection pressure is high, i.e. when agents have a much higher probability of imitating their neighbour with the highest payoff. These findings suggest that the puzzling persistence of hierarchical discrimination may result from the evolutionary dynamics of the social system itself, namely the social imitation dynamics. It also predicts that discrimination will occur more often in highly competitive societies.

Highlights

  • Structural discrimination is a problem across a wide range of societies

  • A rational agent who has to choose between individual options belonging to different groups may try to compensate incomplete information about the quality of each choice by factoring in a prior knowledge about the quality distributions within each group

  • An agent can exhibit in-group favouritism if its strategy is only to cooperate with neighbours carrying the same label as itself, and in-group devalueating if it only cooperates with neighbours carrying the other label

Read more

Summary

Introduction

Structural discrimination is a problem across a wide range of societies. Often, there is no apparent connection between the defining characters of a group and an obvious rational reason to discriminate against its members. Starting from an established model describing the evolution of cooperation in a prisoner’s dilemma type game on graphs[24], we partition the population into two groups by randomly assigning an observable, but completely meaningless, binary label to each agent (blue or green).

Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call