Efficient minimal preference change
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 char...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Oxford University Press
2015
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/33703/ |
| _version_ | 1848794685048356864 |
|---|---|
| author | Alechina, Natasha Liu, Fenrong Logan, Brian |
| author_facet | Alechina, Natasha Liu, Fenrong Logan, Brian |
| author_sort | Alechina, Natasha |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:20:07Z |
| format | Article |
| id | nottingham-33703 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:20:07Z |
| publishDate | 2015 |
| publisher | Oxford University Press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-337032020-05-04T17:08:29Z https://eprints.nottingham.ac.uk/33703/ Efficient minimal preference change Alechina, Natasha Liu, Fenrong Logan, Brian 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. Oxford University Press 2015-05-14 Article PeerReviewed Alechina, Natasha, Liu, Fenrong and Logan, Brian (2015) Efficient minimal preference change. Journal of Logic and Computation . ISSN 1465-363X Preference change; minimal contraction; complexity; preference aggregation http://logcom.oxfordjournals.org/content/early/2015/05/13/logcom.exv027 doi:10.1093/logcom/exv027 doi:10.1093/logcom/exv027 |
| spellingShingle | Preference change; minimal contraction; complexity; preference aggregation Alechina, Natasha Liu, Fenrong Logan, Brian Efficient minimal preference change |
| title | Efficient minimal preference change |
| title_full | Efficient minimal preference change |
| title_fullStr | Efficient minimal preference change |
| title_full_unstemmed | Efficient minimal preference change |
| title_short | Efficient minimal preference change |
| title_sort | efficient minimal preference change |
| topic | Preference change; minimal contraction; complexity; preference aggregation |
| url | https://eprints.nottingham.ac.uk/33703/ https://eprints.nottingham.ac.uk/33703/ https://eprints.nottingham.ac.uk/33703/ |