# Swap Stability in Schelling Games on Graphs

@inproceedings{Agarwal2020SwapSI,
title={Swap Stability in Schelling Games on Graphs},
author={Aishwarya Agarwal and Edith Elkind and Jiarui Gan and Alexandros A. Voudouris},
booktitle={AAAI},
year={2020}
}
We study a recently introduced class of strategic games that is motivated by and generalizes Schelling's well-known residential segregation model. These games are played on undirected graphs, with the set of agents partitioned into multiple types; each agent either occupies a node of the graph and never moves away or aims to maximize the fraction of her neighbors who are of her own type. We consider a variant of this model that we call swap Schelling games, where the number of agents is equal… Expand

#### Figures and Topics 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
• 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
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
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
Modied Schelling Games
We introduce the class of modied Schelling games in which there are dierent types of agents who occupy the nodes of a location graph; agents of the same type are friends, and agents of dierentExpand
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
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
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
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
Graphical One-Sided Markets
• Computer Science
• IJCAI
• 2019
We study the problem of allocating indivisible objects to a set of rational agents where each agent's final utility depends on the intrinsic valuation of the allocated item as well as the allocationExpand

#### References

SHOWING 1-10 OF 40 REFERENCES
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
Hedonic Diversity Games
• Computer Science
• AAMAS
• 2019
It is shown that a core stable outcome may fail to exist and checking the existence of core stable outcomes is computationally hard, and an efficient algorithm is proposed to find an individually stable outcome under the natural assumption that agents' preferences over fractions of the agents of their own type are single-peaked. Expand
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
Fractional Hedonic Games
• Computer Science
• AAMAS
• 2014
This article proposes a number of conditions under which the core of FHGs is non-empty and provides algorithms for computing a core stable outcome and shows that the core may be empty in other cases, and that it is computationally hard in general to decide non-emptiness of the core. 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
The Stability of Hedonic Coalition Structures
• Economics, Computer Science
• Games Econ. Behav.
• 2002
This work considers the partitioning of a society into coalitions in purely hedonic settings, and shows that if coalitions can be ordered according to some characteristic over which players have single-peaked preferences, then there exists an individually stable coalition partition. Expand
Graphical One-Sided Markets
• Computer Science
• IJCAI
• 2019
We study the problem of allocating indivisible objects to a set of rational agents where each agent's final utility depends on the intrinsic valuation of the allocated item as well as the allocationExpand
HEDONIC COALITIONS: OPTIMALITY AND STABILITY
• Economics
• 1980
In many economic situations, individuals carry out activities as coalitions, and have personal preferences for belonging to specific groups (coalitions). These situations are studied in the frameworkExpand
Residential segregation in an all-integrationist world
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
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