# Welfare Guarantees in Schelling Segregation

@inproceedings{Bullinger2021WelfareGI,
title={Welfare Guarantees in Schelling Segregation},
author={Martin Bullinger and Warut Suksompong and Alexandros A. Voudouris},
booktitle={AAAI},
year={2021}
}
• Published in AAAI 2021
• Economics, Computer Science
Schelling's model is an influential model that reveals how individual perceptions and incentives can lead to racial segregation. Inspired by a recent stream of work, we study welfare guarantees and complexity in this model with respect to several welfare measures. First, we show 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. We then consider Pareto optimality and introduce two new… Expand
4 Citations

#### Figures from this paper

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
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
Computing Desirable Outcomes in Specific Multi-Agent Scenarios
This thesis investigates how to compute desirable outcomes efficiently and how to deal with computational intractability by means of approximation algorithms, randomization, or domain restrictions. Expand
Not all Strangers are the Same: The Impact of Tolerance in Schelling Games
• Computer Science
• ArXiv
• 2021
This work considers natural generalizations that allow for the possibility of agents being tolerant towards other agents, even if they are not of the same type, and provides a collection of results about the existence of equilibria, and their quality in terms of social welfare. Expand

#### References

SHOWING 1-10 OF 33 REFERENCES
Convergence and Hardness of Strategic Schelling Segregation
It is shown that in case of convergence, IRD find an equilibrium in $\mathcal{O}(m)$ steps, where $m$ is the number of edges in the underlying graph and this bound is met in empirical simulations starting from random initial agent placements. 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
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
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
The Price of Fairness for Indivisible Goods
• Computer Science, Economics
• IJCAI
• 2019
This paper investigates the efficiency of fair allocations of indivisible goods using the well-studied price of fairness concept, and provides tight or asymptotically tight bounds on the worst-case efficiency loss for allocations satisfying notions with guaranteed existence, including envy-freeness up to one good, balancedness, maximum Nash welfare, and leximin. 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
On Pareto Optimality in Social Distance Games
• Computer Science
• AAAI
• 2017
Asymptotically tight bounds on the Price of Pareto Optimality are determined for several classes of social graphs arising from the following combinations: unbounded and bounded node degree, undirected and directed edges, unweighted and weighted edges. Expand
Pareto-Optimality in Cardinal Hedonic Games
Algorithms are given that find Pareto-optimal partitions under some natural restrictions in classes of hedonic games with cardinal utilities that can be succinctly represented by means of complete weighted graphs, namely additively separable (ASHG), fractional (FHG), and modified fractional Hedonic Games (MFHG). 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