The Parameterized Complexity of Welfare Guarantees in Schelling Segregation

Research output: Contribution to journal › Article › peer-review

Original language	English
Article number	114783
Number of pages	13
Journal	Theoretical Computer Science
Volume	1017
Early online date	28 Aug 2024
DOIs	https://doi.org/10.1016/j.tcs.2024.114783
Publication status	Published - 21 Nov 2024

Access to Document

@article{34aaf2de9cc1440598a29b24857a1b41,

title = "The Parameterized Complexity of Welfare Guarantees in Schelling Segregation",

author = "Argyrios Deligkas and Eduard Eiben and Tiger-Lily Goldsmith",

year = "2024",

month = nov,

day = "21",

doi = "10.1016/j.tcs.2024.114783",

language = "English",

volume = "1017",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - The Parameterized Complexity of Welfare Guarantees in Schelling Segregation

AU - Deligkas, Argyrios

AU - Eiben, Eduard

AU - Goldsmith, Tiger-Lily

PY - 2024/11/21

Y1 - 2024/11/21

UR - https://www.sciencedirect.com/science/article/pii/S0304397524004006

U2 - 10.1016/j.tcs.2024.114783

DO - 10.1016/j.tcs.2024.114783

M3 - Article

SN - 0304-3975

VL - 1017

JO - Theoretical Computer Science

JF - Theoretical Computer Science

M1 - 114783

ER -