{"type":"ScholarlyArticle","title":"Are There Any Nicely Structured Preference Profiles Nearby?","authors":[{"name":"Robert Bredereck","slug":"robert-bredereck","given":"Robert","family":"Bredereck","affiliation":""},{"name":"Jiehua Chen","slug":"jiehua-chen","given":"Jiehua","family":"Chen","affiliation":""},{"name":"Gerhard J. Woeginger","slug":"gerhard-j-woeginger","given":"Gerhard J.","family":"Woeginger","affiliation":""}],"abstract":"We investigate the problem of deciding whether a given preference profile is close to a nicely structured preference profile of a certain type, 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 so as to reach a nicely structured profile. Our results classify all considered 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.","doi":null,"url":"https://ijcai.org/proceedings/2013/21","pdf":"https://ijcai.org/proceedings/2013/0021.pdf","markdown":"https://ijcai.org/proceedings/2013/21.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/21","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":21,"pages":{"first":62,"last":67},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}