Skip to main navigation Skip to search Skip to main content

Minimal preference change

Research output: Chapter in Book/Report/Conference proceedingConference Article in proceedingAcademicpeer-review

Abstract

We propose a novel approach to preference change. We treat a set of preferences as a special kind of theory, and define minimal change contraction and revision operations in the spirit of minimal change as advocated by the Alchourron, Gardenfors, and Makinson (AGM) 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 also define minimal contraction by a set of preferences, and for a significant special case state postulates, prove a representation theorem, and provide an efficient algorithm implementing minimal contraction by a set of preferences.

Original languageEnglish
Title of host publicationLogic, Rationality, and Interaction - 4th International Workshop, LORI 2013, Proceedings
Pages15-26
Number of pages12
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event4th International Workshop on Logic, Rationality, and Interaction, LORI 2013 - Hangzhou, China
Duration: 9 Oct 201312 Oct 2013

Publication series

SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8196 LNCS
ISSN0302-9743

Conference

Conference4th International Workshop on Logic, Rationality, and Interaction, LORI 2013
Abbreviated titleLORI 2013
Country/TerritoryChina
CityHangzhou
Period9/10/1312/10/13

Fingerprint

Dive into the research topics of 'Minimal preference change'. Together they form a unique fingerprint.

Cite this