Are there any nicely structured preference profiles nearby?

Robert Bredereck, Jiehua Chen, Gerhard J. Woeginger

Research output: Contribution to journalArticlepeer-review

38 Scopus citations

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.

Original languageEnglish
Pages (from-to)61-73
Number of pages13
JournalMathematical Social Sciences
Volume79
DOIs
StatePublished - 1 Jan 2016
Externally publishedYes

ASJC Scopus subject areas

  • Sociology and Political Science
  • General Social Sciences
  • General Psychology
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'Are there any nicely structured preference profiles nearby?'. Together they form a unique fingerprint.

Cite this