Efficient minimal preference change

DOI10.1093/LOGCOM/EXV027MaRDI QIDQ5222679zbMATH OpenOpenAlexFDO

Authors Natasha Alechina, Fenrong Liu, Brian Logan

Publication date 10 July 2019

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL http://eprints.nottingham.ac.uk/33703/

zbMATH Keywords

complexitypreference aggregationpreference changeminimal contraction

Mathematics Subject Classification ID

Individual preferences (91B08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logics of knowledge and belief (including belief change) (03B42)

Recommendations

• Minimal preference change
• Preference change
• Changes in preference
• scientific article; zbMATH DE number 1500573
• Dynamically stable preferences
• Efficient pairwise preference elicitation allowing for indifference
• Hyper-minimisation Made Efficient
• Minimal belief change and the Pareto principle

Cited in

(5)

• Contracting preference relations for database applications
• Minimal preference change
• Minimality of a solution update in conflict resolution: An application of revision programming to the von Neumann-Morgenstern approach
• A theory of change for prioritised resilient and evolvable software systems
• Working with Preferences: Less Is More

This page was built for publication: Efficient minimal preference change

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222679)