论文信息 - An Algebraic Approach to Preference Relations

An Algebraic Approach to Preference Relations

We define a class of structures - preference algebras - such that properties of preference relations can be expressed with their operations. We prove a discrete duality between preference algebras and preference relational structures.

Ivo Düntsch | Ewa Orlowska | E. Orlowska | I. Düntsch

[1] H.C.M. de Swart,et al. Logic, Game Theory and Social Choice , 1999 .

[2] Ivo Düntsch,et al. Beyond modalities: sufficiency and mixed algebras , 2001 .

[3] Marc Pauly. Formal Methods and the Theory of Social Choice , 2008, RelMiCS.

[4] Bernhard Möller,et al. Relations and Kleene Algebras in Computer Science , 2008, J. Log. Algebraic Methods Program..

[5] Gunther Schmidt,et al. Relational Mathematics , 2010, Encyclopedia of Mathematics and its Applications.

[6] Ewa Orlowska,et al. Discrete Duality and Its Applications to Reasoning with Incomplete Information , 2007, RSEISP.

[7] Ivo Düntsch,et al. Relational Semantics Through Duality , 2005, RelMiCS.

[8] Gunther Schmidt,et al. Relational Methods in Computer Science , 1999, Inf. Sci..

[9] Ivo Düntsch,et al. Boolean algebras arising from information systems , 2004, Ann. Pure Appl. Log..

[10] A. Tarski,et al. Boolean Algebras with Operators , 1952 .

[11] Marc Roubens,et al. Fuzzy Preference Modelling and Multicriteria Decision Support , 1994, Theory and Decision Library.

[12] A. Tarski,et al. Boolean Algebras with Operators. Part I , 1951 .