Aggregating Interval Orders by Propositional Optimization
Le Berre, Daniel; Marquis, Pierre; Ozturk, Meltem (2009), Aggregating Interval Orders by Propositional Optimization, in Tsoukiàs, Alexis, First International Conference on Algorithmic Decision Theory , ADT 2009, Springer : Berlin Heidelberg, p. 249-260. 10.1007/978-3-642-04428-1_22
TypeCommunication / Conférence
Book titleFirst International Conference on Algorithmic Decision Theory , ADT 2009
Book authorTsoukiàs, Alexis
MetadataShow full item record
Author(s)Le Berre, Daniel
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)Aggregating preferences for finding a consensus between several agents is an important issue in many fields, like economics, decision theory and artificial intelligence. In this paper we focus on the problem of aggregating interval orders which are special preference structures allowing the introduction of tresholds for the indifference relation. We propose to solve this problem by first translating it into a propositional optimization problem, namely the Binate Covering Problem, then to solve the latter using a max-sat solver. We discuss some properties of the proposed encoding and provide some hints about its practicability using preliminary experimental results.
Subjects / KeywordsInterval orders; preference modelling and aggregation; propositional reasoning; Boolean optimization
Showing items related by title and author.