Skip to main content
Springer Nature Link
Log in

Aggregating Interval Orders by Propositional Optimization

  • Conference paper
Algorithmic Decision Theory (ADT 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5783))

Included in the following conference series:

  • 1068 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Argelich, J., Li, C.-M., Manyà, F., Planes, J.: The first and second max-sat evaluations. Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 4, 251–278 (2008)

    Article  Google Scholar 

  2. Arrow, K.J.: Social choice and individual values, 2nd edn. J. Wiley, New York (1951/1963)

    MATH  Google Scholar 

  3. de Condorcet, M.: Essai sur l’application de l’analyse à la probabilité des décisions rendues à la pluralité des voix. Imprimerie Royale, Paris (1785)

    Google Scholar 

  4. Coudert, O.: On solving covering problems. In: Design Automation Conference, pp. 197–202 (1996)

    Google Scholar 

  5. Fishburn, P.C.: Interval Orders and Interval Graphs. J. Wiley, New York (1985)

    Book  Google Scholar 

  6. Gibbard, A.: Social choice and the arrow conditions (unpublished, 1969)

    Google Scholar 

  7. Hudry, O.: Np-hardness results for the aggregation of linear orders into median orders. Annals of Operations Research 163, 63–88 (2008)

    Article  MathSciNet  Google Scholar 

  8. Kemeny, J.G.: Mathematics without numbers. Daedalus 88, 575–591 (1959)

    Google Scholar 

  9. Le Berre, D., Parrain, A.: SAT4J, a SATisfiability library for java, http://www.sat4j.org

  10. Luce, R.D.: Semi-orders and a theory of utility discrimination. Econometrica 24 (1956)

    Google Scholar 

  11. Manquinho, V., Roussel, O.: The first evaluation of pseudo-boolean solvers (pb 2005). Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 2, 103–143 (2006)

    Article  Google Scholar 

  12. Papadimitriou, C., Steiglitz, I.: Combinatorial Optimization: algorithms and complexity. Prentice-Hall, Englewood Cliffs (1982)

    MATH  Google Scholar 

  13. Pirlot, M., Vincke, P.: Semi Orders. Kluwer Academic, Dordrecht (1997)

    Google Scholar 

  14. Sen, A.K.: Collective Choice and Social Welfare. North Holland, Amsterdam (1970)

    MATH  Google Scholar 

  15. Stanley, R.: Hyperplanes arrangements, interval orders and trees. Proc. Nat. Acad. Sci. 93, 2620–2625 (1996)

    Article  MathSciNet  Google Scholar 

  16. Wiener, N.: A contribution to the theory of relative position. Proc. of Cambridge Philosophical Society 17, 441–449 (1914)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Lille Nord de France, F-59000, Lille, France

    Daniel Le Berre, Pierre Marquis & Meltem Öztürk

  2. Université d’Artois, CRIL, F-62307, Lens, France

    Daniel Le Berre, Pierre Marquis & Meltem Öztürk

  3. CNRS, UMR 8188, F-62307, Lens, France

    Daniel Le Berre, Pierre Marquis & Meltem Öztürk

Authors
  1. Daniel Le Berre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Marquis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meltem Öztürk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Pure and Applied Mathematics, University of Padova, Via Trieste 63, 35121, Padova, Italy

    Francesca Rossi

  2. LAMSADE-CNRS, University of Paris Dauphine, Place du Maréchal De Lattre de Tassigny, 75775, Paris Cedex 16, France

    Alexis Tsoukias

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Le Berre, D., Marquis, P., Öztürk, M. (2009). Aggregating Interval Orders by Propositional Optimization. In: Rossi, F., Tsoukias, A. (eds) Algorithmic Decision Theory. ADT 2009. Lecture Notes in Computer Science(), vol 5783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04428-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04428-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04427-4

  • Online ISBN: 978-3-642-04428-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics