The parameterized complexity of welfare guarantees in Schelling segregation
From MaRDI portal
Publication:6614026
DOI10.1016/J.TCS.2024.114783MaRDI QIDQ6614026
Tiger-Lily Goldsmith, Eduard Eiben, Argyrios Deligkas
Publication date: 7 October 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Unperturbed Schelling segregation in two or three dimensions
- Fundamentals of parameterized complexity
- Convergence and hardness of strategic Schelling segregation
- On total functions, existence theorems and computational complexity
- How easy is local search?
- On the complexity of the parity argument and other inefficient proofs of existence
- Treewidth. Computations and approximations
- Schelling segregation with strategic agents
- Minority population in the one-dimensional Schelling model of segregation
- Bin packing with fixed number of bins revisited
- Schelling games on graphs
- Tipping points in 1-dimensional Schelling models with switching agents
- A \(c^k n\) 5-approximation algorithm for treewidth
- Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals
- The Parameterized Complexity of the k -Biclique Problem
- Digital morphogenesis via Schelling segregation
- A DYNAMIC MODEL OF RESIDENTIAL SEGREGATION
- Welfare Guarantees in Schelling Segregation
- Topological Influence and Locality in Swap Schelling Games.
- Parameterized Algorithms
- Modified Schelling games
- Not all strangers are the same: the impact of tolerance in Schelling games
- Single-Peaked Jump Schelling Games
This page was built for publication: The parameterized complexity of welfare guarantees in Schelling segregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614026)
