DeepAI AI Chat
Log In Sign Up

Recognizing when a preference system is close to admitting a master list

by   Ildikó Schlotter, et al.

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.


page 1

page 2

page 3

page 4


Maximum-utility popular matchings with bounded instability

In a graph where vertices have preferences over their neighbors, a match...

Multidimensional Stable Roommates with Master List

Since the early days of research in algorithms and complexity, the compu...

Preference Swaps for the Stable Matching Problem

An instance I of the Stable Matching Problem (SMP) is given by a biparti...

Parameterized Analysis of Assignment Under Multiple Preferences

The Assignment problem is a fundamental, well-studied problem in the int...

Hedonic Seat Arrangement Problems

In this paper, we study a variant of hedonic games, called Seat Arrangem...

Digraphs Homomorphism Problems with Maltsev Condition

We consider a generalization of finding a homomorphism from an input dig...

Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors

Given an undirected graph G=(V,E) the NP-hard Strong Triadic Closure (ST...