Efficient minimal preference change

Alechina, Natasha and Liu, Fenrong and Logan, Brian (2015) Efficient minimal preference change. Journal of Logic and Computation . ISSN 1465-363X

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (279kB) | Preview

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.

Item Type: Article
Additional Information: This is a pre-copyedited, author-produced PDF of an article accepted for publication in Journal of Logic and Computation following peer review. The version of record J Logic Computation (2015) doi: 10.1093/logcom/exv027 is available online at: http://logcom.oxfordjournals.org/content/early/2015/05/13/logcom.exv027
Keywords: Preference change; minimal contraction; complexity; preference aggregation
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1093/logcom/exv027
Depositing User: Eprints, Support
Date Deposited: 05 Jun 2016 09:13
Last Modified: 23 Sep 2016 15:02
URI: http://eprints.nottingham.ac.uk/id/eprint/33703

Actions (Archive Staff Only)

Edit View Edit View