Schelling Segregation with Strategic Agents

June 22, 2018 ยท Declared Dead ยท ๐Ÿ› Algorithmic Game Theory

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ankit Chauhan, Pascal Lenzner, Louise Molitor arXiv ID 1806.08713 Category cs.GT: Game Theory Cross-listed cs.SI, physics.soc-ph Citations 50 Venue Algorithmic Game Theory Last Checked 2 months ago
Abstract
Schelling's segregation model is a landmark model in sociology. It shows the counter-intuitive phenomenon that residential segregation between individuals of different groups can emerge even when all involved individuals are tolerant. Although the model is widely studied, no pure game-theoretic version where rational agents strategically choose their location exists. We close this gap by introducing and analyzing generalized game-theoretic models of Schelling segregation, where the agents can also have individual location preferences. For our models, we investigate the convergence behavior and the efficiency of their equilibria. In particular, we prove guaranteed convergence to an equilibrium in the version which is closest to Schelling's original model. Moreover, we provide tight bounds on the Price of Anarchy.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Game Theory

R.I.P. ๐Ÿ‘ป Ghosted

Blockchain Mining Games

Aggelos Kiayias, Elias Koutsoupias, ... (+2 more)

cs.GT ๐Ÿ› EC ๐Ÿ“š 273 cites 9 years ago

Died the same way โ€” ๐Ÿ‘ป Ghosted