Aggregating Interval Orders by Propositional Optimization

  • Authors:

  • Daniel Berre;Pierre Marquis;Meltem Öztürk

  • Affiliations:

  • Université Lille Nord de France, Lille, France F-59000 and Université d'Artois, CRIL, Lens, France F-62307 and CNRS, UMR 8188, Lens, France F-62307;Université Lille Nord de France, Lille, France F-59000 and Université d'Artois, CRIL, Lens, France F-62307 and CNRS, UMR 8188, Lens, France F-62307;Université Lille Nord de France, Lille, France F-59000 and Université d'Artois, CRIL, Lens, France F-62307 and CNRS, UMR 8188, Lens, France F-62307

  • Venue:
  • ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.