# Schelling Games on Graphs

arXiv: https://arxiv.org/abs/1902.07937 · HTML: https://mlsanity.com/paper/1902.07937/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 Feb 2019.

## Built on by (most cited first, 5 of 5)

- [Strategic Resource Selection with Homophilic Agents](https://mlsanity.com/paper/2305.00843/) (2023)
- [Single-Peaked Jump Schelling Games](https://mlsanity.com/paper/2302.12107/) (2023)
- [Schelling Games with Continuous Types](https://mlsanity.com/paper/2305.06819/) (2023)
- [The Bakers and Millers Game with Restricted Locations](https://mlsanity.com/paper/2501.05334/) (2025)
- [Metric Hedonic Games on the Line](https://mlsanity.com/paper/2602.05888/) (2026)

## Abstract (arXiv)

We consider strategic games that are inspired by Schelling's model of residential segregation. In our model, the agents are partitioned into k types and need to select locations on an undirected graph. Agents can be either stubborn, in which case they will always choose their preferred location, or strategic, in which case they aim to maximize the fraction of agents of their own type in their neighborhood. We investigate the existence of equilibria in these games, study the complexity of finding an equilibrium outcome or an outcome with high social welfare, and also provide upper and lower bounds on the price of anarchy and stability. Some of our results extend to the setting where the preferences of the agents over their neighbors are defined by a social network rather than a partition into types.