# Convergence and Hardness of Strategic Schelling Segregation

@article{Echzell2019ConvergenceAH, title={Convergence and Hardness of Strategic Schelling Segregation}, author={Hagen Echzell and Tobias Friedrich and Pascal Lenzner and Louise Molitor and Marcus Pappik and Friedrich Sch{\"o}ne and Fabian Sommer and David Stangl}, journal={ArXiv}, year={2019}, volume={abs/1907.07513} }

The phenomenon of residential segregation was captured by Schelling's famous segregation model where two types of agents are placed on a grid and an agent is content with her location if the fraction of her neighbors which have the same type as her is at least $\tau$, for some $0<\tau<1$. Discontent agents simply swap their location with a randomly chosen other discontent agent or jump to a random empty cell.
We analyze a generalized game-theoretic model of Schelling segregation which allows… Expand

#### Figures, Tables, and Topics from this paper

#### 13 Citations

Topological Influence and Locality in Swap Schelling Games

- Computer Science
- MFCS
- 2020

Improved almost tight bounds on the Price of Anarchy for arbitrary underlying graphs and close bounds for regular graphs, paths and cycles are presented and it is shown that locality has a severe impact on the game dynamics. Expand

Modied Schelling Games

- 2020

We introduce the class of modied Schelling games in which there are dierent types of agents who occupy the nodes of a location graph; agents of the same type are friends, and agents of dierent… Expand

Modified Schelling Games

- Computer Science
- SAGT
- 2020

A thorough analysis of the (in)efficiency of equilibria that arise in such modified Schelling games, by bounding the price of anarchy and price of stability for both general graphs and interesting special cases is provided. Expand

Modified Schelling games

- Computer Science
- Theor. Comput. Sci.
- 2021

A thorough analysis of the (in)efficiency of equilibria that arise in such modified Schelling games, by bounding the price of anarchy and price of stability for both general graphs and interesting special cases is provided. Expand

Schelling Games on Graphs

- Computer Science
- IJCAI
- 2019

This work investigates the existence of equilibria in strategic games that are inspired by Schelling's model of residential segregation, study the complexity of finding an equilibrium outcome or an outcome with high social welfare, and also provides upper and lower bounds on the price of anarchy and stability. Expand

Swap Stability in Schelling Games on Graphs

- Computer Science
- AAAI
- 2020

This work studies a recently introduced class of strategic games that is motivated by and generalizes Schelling's well-known residential segregation model, and considers a variant of this model that is call swap Schelling games, where the number of agents is equal to thenumber of nodes of the graph, and agents may swap positions with other agents to increase their utility. Expand

Equilibria in Schelling Games: Computational Complexity and Robustness

- Computer Science
- ArXiv
- 2021

It is proved that deciding the existence of a swap-equilibrium and a jump-Equilibrium in this simplest model of Schelling games is NP-hard, thereby answering questions left open by Agarwal et al. Expand

The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs

- Mathematics, Computer Science
- ArXiv
- 2021

The probability that an edge {u, v} is monochrome, i.e., that both vertices u and v have the same type in the FSP is investigated, and a general framework for analyzing the influence of the underlying graph topology on residential segregation is provided. Expand

Welfare Guarantees in Schelling Segregation

- Economics, Computer Science
- AAAI
- 2021

This work shows that while maximizing the social welfare is NP-hard, computing an assignment with approximately half of the maximum welfare can be done in polynomial time, and considers Pareto optimality and introduces two new optimality notions and establishes mostly tight bounds on the worst-case welfare loss for assignments satisfying these notions. Expand

Schelling Models with Localized Social Influence: A Game-Theoretic Framework

- Computer Science
- AAMAS
- 2020

This work proposes a game-theoretic approach to generalizing the classical Schelling model that allows multiple individuals to occupy the same location and shows that even for various special cases of the problem, computing or counting PSNE is provably hard. Expand

#### References

SHOWING 1-10 OF 46 REFERENCES

Dynamic models of residential segregation: an analytical solution

- Economics
- 2012

We propose an analytical solution to a Schelling segregation model for a relatively broad range of utility functions. Using evolutionary game theory, we provide existence conditions for a potential… Expand

Schelling Games on Graphs

- Computer Science
- IJCAI
- 2019

This work investigates the existence of equilibria in strategic games that are inspired by Schelling's model of residential segregation, study the complexity of finding an equilibrium outcome or an outcome with high social welfare, and also provides upper and lower bounds on the price of anarchy and stability. Expand

Tipping and Residential Segregation: A Unified Schelling Model

- Economics
- 2011

This paper presents a Schelling-type checkerboard model of residential segregation formulated as a spatial game. It shows that although every agent prefers to live in a mixed-race neighborhood,… Expand

Schelling Segregation with Strategic Agents

- Computer Science, Physics
- SAGT
- 2018

This work introduces and analyzes generalized game-theoretic models of Schelling segregation, where the agents can also have individual location preferences, and closes the gap in the model where rational agents strategically choose their location. Expand

Schelling's Segregation Model: Parameters, Scaling, and Aggregation

- Physics, Mathematics
- 2007

Thomas Schelling proposed a simple spatial model to illustrate how, even with relatively mild assumptions on each individual's nearest neighbor preferences, an integrated city would likely unravel to… Expand

Clustering and Mixing Times for Segregation Models on ℤ2

- Computer Science, Mathematics
- SODA
- 2014

The Schelling model is generalized to include a broad class of bias functions determining individuals happiness or desire to move, called the General Influence Model, and it is shown that for any influence function in this class, the dynamics will be rapidly mixing and cities will be integrated if the racial bias is sufficiently low. Expand

Residential segregation in an all-integrationist world

- Computer Science
- 2004

A variation of the Schelling model to show that segregation emerges and persists even if every person in the society prefers to live in a half-black, half-white neighborhood is presented. Expand

Schelling's Spatial Proximity Model of Segregation Revisited

- Economics, Computer Science
- 2003

It is argued that the one-dimensional and two-dimensional versions of Schelling's spatial proximity model are in fact two qualitatively very different models of segregation. Expand

Digital Morphogenesis via Schelling Segregation

- Computer Science, Mathematics
- 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
- 2014

A rigorous analysis of the model's behaviour much more generally is provided and some surprising forms of threshold behaviour are established, notably the existence of situations where an increased level of intolerance for neighbouring agents of opposite type leads almost certainly to decreased segregation. Expand

An analysis of one-dimensional schelling segregation

- Computer Science, Mathematics
- STOC '12
- 2012

This analysis is the first rigorous analysis of the Schelling dynamics of segregation in which a society of n individuals live in a ring and the average size of monochromatic neighborhoods in the final stable state is considered. Expand