Mobility Sharing for Social Integration: A Reverse Schelling Model (1.0.0)
This model extends Schelling’s segregation model with mobility sharing. Agents of two groups occupy cells of a 32 × 32 grid and repeatedly choose activity destinations subject to a preference threshold, the minimum share of ingroup neighbours they accept. Trips are matched into shared rides between members of different groups, using one of four matching algorithms on a shareability network (maximal cross-group matching, maximum weight matching on contact time, maximum cardinality matching, or random greedy matching) with a maximum detour constraint. After each trip, an agent’s preference threshold changes with the time spent in contact with outgroup members.
Starting from complete segregation, the model examines under which conditions contact during shared trips leads to integration. Besides the main scenario, in which contact always lowers the threshold, it includes two extensions. In the first, a share of adversarial agents becomes less tolerant with contact, and this share grows or shrinks with the current level of segregation, governed by a branching dissimilarity index and a conversion rate. In the second, each contact raises or lowers the threshold with a probability that depends on the agent’s current attitude relative to a compatibility threshold.
Segregation is measured with the index of dissimilarity and the Gini coefficient. The model file includes BehaviorSpace experiments for each analysis in the associated article. The matching step uses the NetworkX library through the Python extension of NetLogo (requires Python 3 with numpy and networkx 3.x).
Release Notes
Initial release accompanying the article “Mobility Sharing for Social Integration: A Reverse Schelling Model”. A single NetLogo model contains the main scenario, adversarial agents and attitude-dependent contact effects, with BehaviorSpace experiments for each analysis in the article.
Associated Publications
Mobility Sharing for Social Integration: A Reverse Schelling Model 1.0.0
Submitted by
Hongmou Zhang
Published Oct 15, 2026
Last modified Oct 15, 2026
This model extends Schelling’s segregation model with mobility sharing. Agents of two groups occupy cells of a 32 × 32 grid and repeatedly choose activity destinations subject to a preference threshold, the minimum share of ingroup neighbours they accept. Trips are matched into shared rides between members of different groups, using one of four matching algorithms on a shareability network (maximal cross-group matching, maximum weight matching on contact time, maximum cardinality matching, or random greedy matching) with a maximum detour constraint. After each trip, an agent’s preference threshold changes with the time spent in contact with outgroup members.
Starting from complete segregation, the model examines under which conditions contact during shared trips leads to integration. Besides the main scenario, in which contact always lowers the threshold, it includes two extensions. In the first, a share of adversarial agents becomes less tolerant with contact, and this share grows or shrinks with the current level of segregation, governed by a branching dissimilarity index and a conversion rate. In the second, each contact raises or lowers the threshold with a probability that depends on the agent’s current attitude relative to a compatibility threshold.
Segregation is measured with the index of dissimilarity and the Gini coefficient. The model file includes BehaviorSpace experiments for each analysis in the associated article. The matching step uses the NetworkX library through the Python extension of NetLogo (requires Python 3 with numpy and networkx 3.x).
Release Notes
Initial release accompanying the article “Mobility Sharing for Social Integration: A Reverse Schelling Model”. A single NetLogo model contains the main scenario, adversarial agents and attitude-dependent contact effects, with BehaviorSpace experiments for each analysis in the article.