@article { , title = {Efficient minimal preference change}, abstract = {In this article, we study a minimal change approach to preference dynamics. We treat a set of preferences as a special kind of theory, and define minimal change preference contraction and revision operations in the spirit of the Alchourrón, Gärdenfors, and Makinson theory of belief revision. We characterise minimal contraction of preference sets by a set of postulates and prove a representation theorem. We also give a linear time algorithm which implements minimal contraction by a single preference. We then define minimal contraction by a set of preferences, and show that the problem of a minimal contraction by a set of preferences is NP-hard.}, doi = {10.1093/logcom/exv027}, eissn = {1465-363X}, issn = {0955-792X}, issue = {8}, journal = {Journal of Logic and Computation}, note = {Acceptance date from email was 29.04.15, which has been updated. EC, 02.06.16 Contacted author for acceptance date. Published online but not yet in a journal. 12 month embargo, expired 14.05.16. Contacted author for publication notification. Will need to update the set statement as well when published to include full citation information in Additional Information. EC, 01.06.16. VEA 22.08.16}, pages = {1715–1733}, publicationstatus = {Published}, publisher = {Oxford University Press}, url = {https://nottingham-repository.worktribe.com/output/752047}, volume = {28}, keyword = {Preference change, minimal contraction, complexity, preference aggregation}, year = {2018}, author = {Alechina, Natasha and Liu, Fenrong and Logan, Brian} }