Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:pure.tue.nl:openaire_cris_publications/875da4ac-0e7d-46a8-9b45-d6d8f06ede03

Are there any nicely structured preference profiles nearby?

Authors
Publication date
1 January 2016
Publisher
Doi

    Abstract

    We investigate the problem of deciding whether a given preference profile is close to having a certain nice structure, as for instance single-peaked, single-caved, single-crossing, value-restricted, best-restricted, worst-restricted, medium-restricted, or group-separable profiles. We measure this distance by the number of voters or alternatives that have to be deleted to make the profile a nicely structured one. Our results classify the problem variants with respect to their computational complexity, and draw a clear line between computationally tractable (polynomial-time solvable) and computationally intractable (NP-hard) questions.</p

    Similar works

    Full text

    thumbnail-image

    Pure OAI Repository

    redirect
    oaioai:pure.tue.nl:openaire_cris_...
    Last time updated on 11/08/2023

    This paper was published in Pure OAI Repository.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.