Research Repository

Swap Stability in Schelling Games on Graphs

Agarwal, Aishwarya and Elkind, Edith and Gan, Jiarui and Voudouris, Alexandros A (2020) Swap Stability in Schelling Games on Graphs. In: 34th AAAI Conference on Artificial Intelligence, 2020-02-07 - 2020-02-12, New York, USA.

[img]
Preview
Text
1909.02421v3.pdf - Accepted Version

Download (1MB) | Preview

Abstract

We study a recently introduced class of strategic games thatis motivated by and generalizes Schelling’s well-known resi-dential segregation model. These games are played on undi-rected graphs, with the set of agents partitioned into multi-ple types; each agent either occupies a node of the graph andnever moves away or aims to maximize the fraction of herneighbors who are of her own type. We consider a variant ofthis model that we call swap Schelling games, where the num-ber of agents is equal to the number of nodes of the graph, andagents mayswappositions with other agents to increase theirutility. We study the existence, computational complexity andquality of equilibrium assignments in these games, both froma social welfare perspective and from a diversity perspective.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published proceedings: _not provided_
Uncontrolled Keywords: cs.GT, cs.GT
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Elements
Date Deposited: 20 May 2020 15:25
Last Modified: 20 May 2020 16:15
URI: http://repository.essex.ac.uk/id/eprint/27297

Actions (login required)

View Item View Item