Recognizing when a preference system is close to admitting a master list
share
A preference system ℐ is an undirected graph where vertices have preferences over their neighbors, and ℐ admits a master list if all preferences can be derived from a single ordering over all vertices. We study the problem of deciding whether a given preference system ℐ is close to admitting a master list based on three different distance measures. We determine the computational complexity of the following questions: can ℐ be modified by (i) k swaps in the preferences, (ii) k edge deletions, or (iii) k vertex deletions so that the resulting instance admits a master list? We investigate these problems in detail from the viewpoint of parameterized complexity and of approximation. We also present two applications related to stable and popular matchings.
READ FULL TEXT
