Year: 2020
Type: conference-paper
Abstract: We analyze the complexity of several NP-hard election-related problems under the assumptions that the voters have group-separable preferences. We show that under this assumption our problems typically remain NP-hard, but we provide more efficient algorithms if additionally the clone decomposition tree is of moderate height.
Language: English
Subfield: Economics and Econometrics
Domain: Social Sciences
Open Access status: bronze
OpenAlex ID: W3034840586
